|
|
|
Сперанский Станислав Олегович
(публикации за последние годы)
|
|
2020 |
1. |
S. P. Odintsov, S. O. Speranski, “Belnap–Dunn modal logics: truth constants vs. truth values”, Review of Symbolic Logic, 13:2 (2020), 416–435 (cited: 1) (cited: 1) |
|
2019 |
2. |
L. Horsten, S. O. Speranski, “Reasoning about arbitrary natural numbers from a Carnapian perspective”, Journal of Philosophical Logic, 48:4 (2019), 685–707 (cited: 1) |
|
2018 |
3. |
S. P. Odintsov, S. O. Speranski, I. Yu. Shevchenko, “Hintikka's independence-friendly logic meets Nelson's realizability”, Studia Logica, 106:3 (2018), 637–670 (cited: 1) (cited: 2) |
|
2017 |
4. |
S. O. Speranski, “Quantifying over events in probability logic: an introduction”, Mathematical Structures in Computer Science, 27:8 (2017), 1581–1600 (cited: 1) (cited: 2) |
5. |
S. O. Speranski, “Notes on the computational aspects of Kripkes theory of truth”, Studia Logica, 105:2 (2017), 407–429 (cited: 2) (cited: 2) |
|
2016 |
6. |
S. O. Speranski, “A note on hereditarily $\Pi^0_1$- and $\Sigma^0_1$-complete sets of sentences”, Journal of Logic and Computation, 26:5 (2016), 1729–1741 (cited: 2) (cited: 2) |
7. |
S. P. Odintsov, S. O. Speranski, “The lattice of Belnapian modal logics: special extensions and counterparts”, Logic and Logical Philosophy, 25:1 (2016), 3–33 (cited: 8) (cited: 9) |
|
2015 |
8. |
S. O. Speranski, “Some new results in monadic second-order arithmetic”, Computability, 4:2 (2015), 159–174 (cited: 1) (cited: 1) |
|
2013 |
9. |
S. O. Speranski, “A note on definability in fragments of arithmetic with free unary predicates”, Archive for Mathematical Logic, 52:5–6 (2013), 507–516 (cited: 4) (cited: 4) |
10. |
С. О. Сперанский, “О схлопывании вероятностных иерархий. I”, Алгебра и логика, 52:2 (2013), 236–254 (цит.: 1) (цит.: 1); S. O. Speranskii, “Collapsing probabilistic hierarchies. I”, Algebra and Logic, 52:2 (2013), 159–171 (cited: 1) (cited: 1) |
11. |
S. O. Speranski, “On Belnapian modal algebras: representations, homomorphisms, congruences, and so on”, Сиб. электрон. матем. изв., 10 (2013), 517–534 (цит.: 2) |
12. |
S. O. Speranski, “Complexity for probability logic with quantifiers over propositions”, Journal of Logic and Computation, 23:5 (2013), 1035–1055 (cited: 5) (cited: 5) |
13. |
S. P. Odintsov, S. O. Speranski, “Computability issues for adaptive logics in multi-consequence standard format”, Studia Logica, 101:6, Advances in Philosophical Logic (2013), 1237–1262 (cited: 9) (cited: 10) |
|
2012 |
14. |
S. P. Odintsov, S. O. Speranski, “On algorithmic properties of propositional inconsistency-adaptive logics”, Logic and Logical Philosophy, 21:3 (2012), 209–228 (cited: 9) |
|
2011 |
15. |
С. О. Сперанский, “Квантификация по пропозициональным формулам в вероятностной логике: вопросы разрешимости”, Алгебра и логика, 50:4 (2011), 533–546 (цит.: 3) (цит.: 3); S. O. Speranski, “Quantification over propositional formulas in probability logic: decidability issues”, Algebra and Logic, 50:4 (2011), 365–374 (cited: 3) (cited: 4) |
16. |
С. О. Сперанский, “О вычислительных аспектах максимальной специфичности в вероятностном объяснении”, Вестн. НГУ. Сер. матем., мех., информ., 11:4 (2011), 78–93 |
17. |
С. О. Сперанский, “О логической непротиворечивости вероятностных предсказаний”, Вестн. НГУ. Сер. матем., мех., информ., 11:1 (2011), 99–115 (цит.: 1) |
|