×

zbMATH — the first resource for mathematics

Speranski, Stanislav O.

Compute Distance To:
Author ID: speranski.stanislav-o Recent zbMATH articles by "Speranski, Stanislav O."
Published as: Speranski, Stanislav O.; Speranskii, S. O.; Speranskij, S. O.; Speranski, S. O.
Homepage: http://www.mi-ras.ru/~speranski/
External Links: MGP · ORCID · Math-Net.Ru · dblp
Documents Indexed: 18 Publications since 2011

Publications by Year

Citations contained in zbMATH Open

13 Publications have been cited 35 times in 23 Documents Cited by Year
The lattice of Belnapian modal logics: special extensions and counterparts. Zbl 1396.03034
Odintsov, Sergei P.; Speranski, Stanislav O.
8
2016
A note on definability in fragments of arithmetic with free unary predicates. Zbl 1279.03066
Speranski, Stanislav O.
4
2013
Belnap-Dunn modal logics: truth constants vs. truth values. Zbl 07193994
Odintsov, Sergei P.; Speranski, Stanislav O.
3
2020
On algorithmic properties of propositional inconsistency-adaptive logics. Zbl 1283.03059
Odintsov, Sergei P.; Speranski, Stanislav O.
3
2012
Computability issues for adaptive logics in multi-consequence standard format. Zbl 1329.03065
Odintsov, Sergei P.; Speranski, Stanislav O.
3
2013
Notes on the computational aspects of Kripke’s theory of truth. Zbl 1417.03244
Speranski, Stanislav O.
3
2017
Complexity for probability logic with quantifiers over propositions. Zbl 1309.03009
Speranski, Stanislav O.
3
2013
Quantification over propositional formulas in probability logic: decidability issues. Zbl 1432.03033
Speranskii, S. O.
2
2011
On Belnapian modal algebras: representations, homomorphisms, congruences, and so on. Zbl 1330.03047
Speranski, S. O.
2
2013
Hintikka’s independence-friendly logic meets Nelson’s realizability. Zbl 06914013
Odintsov, Sergei P.; Speranski, Stanislav O.; Shevchenko, Igor Yu.
1
2018
Some new results in monadic second-order arithmetic. Zbl 1337.03087
Speranski, Stanislav O.
1
2015
Collapsing probabilistic hierarchies. I. Zbl 1315.03033
Speranskii, S. O.
1
2013
A note on hereditarily \(\Pi_1^0\)- and \(\Sigma_1^0\)-complete sets of sentences. Zbl 1401.03072
Speranski, Stanislav O.
1
2016
Belnap-Dunn modal logics: truth constants vs. truth values. Zbl 07193994
Odintsov, Sergei P.; Speranski, Stanislav O.
3
2020
Hintikka’s independence-friendly logic meets Nelson’s realizability. Zbl 06914013
Odintsov, Sergei P.; Speranski, Stanislav O.; Shevchenko, Igor Yu.
1
2018
Notes on the computational aspects of Kripke’s theory of truth. Zbl 1417.03244
Speranski, Stanislav O.
3
2017
The lattice of Belnapian modal logics: special extensions and counterparts. Zbl 1396.03034
Odintsov, Sergei P.; Speranski, Stanislav O.
8
2016
A note on hereditarily \(\Pi_1^0\)- and \(\Sigma_1^0\)-complete sets of sentences. Zbl 1401.03072
Speranski, Stanislav O.
1
2016
Some new results in monadic second-order arithmetic. Zbl 1337.03087
Speranski, Stanislav O.
1
2015
A note on definability in fragments of arithmetic with free unary predicates. Zbl 1279.03066
Speranski, Stanislav O.
4
2013
Computability issues for adaptive logics in multi-consequence standard format. Zbl 1329.03065
Odintsov, Sergei P.; Speranski, Stanislav O.
3
2013
Complexity for probability logic with quantifiers over propositions. Zbl 1309.03009
Speranski, Stanislav O.
3
2013
On Belnapian modal algebras: representations, homomorphisms, congruences, and so on. Zbl 1330.03047
Speranski, S. O.
2
2013
Collapsing probabilistic hierarchies. I. Zbl 1315.03033
Speranskii, S. O.
1
2013
On algorithmic properties of propositional inconsistency-adaptive logics. Zbl 1283.03059
Odintsov, Sergei P.; Speranski, Stanislav O.
3
2012
Quantification over propositional formulas in probability logic: decidability issues. Zbl 1432.03033
Speranskii, S. O.
2
2011

Citations by Year