RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Speranski, Stanislav Olegovich

Total publications: 17 (17)
in MathSciNet: 14 (14)
in zbMATH: 14 (14)
in Web of Science: 9 (9)
in Scopus: 14 (14)
Cited articles: 16
Citations in Math-Net.Ru: 5
Citations in Web of Science: 18
Citations in Scopus: 50
Presentations: 5

Number of views:
This page:2545
Abstract pages:1048
Full texts:346
References:231
Speranski, Stanislav Olegovich
Candidate of physico-mathematical sciences (2013)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
E-mail:
Website: http://users.math-cs.spbu.ru/~speranski/index.html
UDC: 510.2, 510.5, 510.6
   
Main publications:
  1. S. O. Speranski, “Some new results in monadic second-order arithmetic”, Computability, 4:2 (2015), 159–174  crossref
  2. S. P. Odintsov, S. O. Speranski, I. Yu. Shevchenko, “Hintikkas independence-friendly logic meets Nelsons realizability”, Studia Logica, 106:3 (2018), 637–670  crossref

http://www.mathnet.ru/eng/person71546
List of publications on Google Scholar
http://zbmath.org/authors/?q=ai:speranski.stanislav-o
https://mathscinet.ams.org/mathscinet/MRAuthorID/958860
http://orcid.org/0000-0001-6386-5632
http://www.researcherid.com/rid/L-2043-2016
http://www.scopus.com/authid/detail.url?authorId=55532074400
https://www.researchgate.net/profile/Stanislav_Speranski

Full list of publications:
| scientific publications | by years | by types | by times cited in WoS | by times cited in Scopus | common list |



   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  crossref  isi (cited: 1)  scopus (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  crossref  mathscinet  zmath  isi  scopus (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  crossref  mathscinet  zmath  isi (cited: 1)  scopus (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  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 2)
5. S. O. Speranski, “Notes on the computational aspects of Kripkes theory of truth”, Studia Logica, 105:2 (2017), 407–429  crossref  mathscinet  zmath  isi (cited: 1)  elib  scopus (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  crossref  mathscinet  zmath  isi (cited: 2)  scopus (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  crossref  mathscinet  zmath  isi (cited: 6)  scopus (cited: 7)

   2015
8. S. O. Speranski, “Some new results in monadic second-order arithmetic”, Computability, 4:2 (2015), 159–174  crossref  mathscinet  zmath  elib  scopus (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  crossref  mathscinet  zmath  scopus (cited: 4)
10. S. O. Speranskii, “Collapsing probabilistic hierarchies. I”, Algebra and Logic, 52:2 (2013), 159–171  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  elib  scopus (cited: 1)
11. S. O. Speranski, “On Belnapian modal algebras: representations, homomorphisms, congruences, and so on”, Sib. elektron. matem. izv., 10 (2013), 517–534  mathnet  crossref  mathscinet  zmath  elib  scopus (cited: 1)
12. S. O. Speranski, “Complexity for probability logic with quantifiers over propositions”, Journal of Logic and Computation, 23:5 (2013), 1035–1055  crossref  mathscinet  zmath  scopus (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  crossref  mathscinet  zmath  elib (cited: 5)  scopus (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  crossref  mathscinet  zmath  scopus (cited: 7)

   2011
15. S. O. Speranski, “Quantification over propositional formulas in probability logic: decidability issues”, Algebra and Logic, 50:4 (2011), 365–374  mathnet  crossref  mathscinet  zmath  isi (cited: 3)  elib  scopus (cited: 4)
16. S. O. Speranski, “On computational aspects of the maximal specificity in probabilistic explanation”, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., Mech. and Informatics, 11:4 (2011), 78–93  mathnet
17. S. O. Speranski, “On logical consistency of probabilistic predictions”, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., Mech. and Informatics, 11:1 (2011), 99–115  mathnet

Presentations in Math-Net.Ru
1. Negation as a modality in a quantified setting
S. O. Speranski
Seminars "Proof Theory" and "Logic Online Seminar"
April 20, 2020 18:30   
2. Об истинностных значениях и логических константах в модальных логиках Белнапа–Данна
S. O. Speranski
Traditional winter session MIAN–POMI devoted to the topic "Mathematical logic"
December 25, 2018 16:00   
3. On the computational aspects of Kripke's theory of truth
S. Speranski
Workshop on Proof Theory, Modal Logic and Reflection Principles
October 18, 2017 15:35   
4. О вычислительных аспектах теории истины по Крипке
S. O. Speranski
Seminars "Proof Theory" and "Logic Online Seminar"
April 10, 2017 18:30
5. Некоторые новые результаты в монадической арифметике второго порядка
S. O. Speranski
Seminars "Proof Theory" and "Logic Online Seminar"
September 7, 2015 18:30

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020