RUS  ENG
Full version
PEOPLE
Speranski Stanislav Olegovich
Speranski Stanislav Olegovich
Candidate of physico-mathematical sciences (2013)

Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
E-mail:
Website: https://homepage.mi-ras.ru/~speranski
Keywords: logic, computability, foundations of mathematics
UDC: 510.2, 510.5, 510.6

Subject:

My work mainly addresses topics in logic, computability and the foundations of mathematics.


Main publications:
  1. S. O. Speranski, “On the decision problem for quantified probability logics”, Izvestiya: Mathematics, 89:3 (2025), 609–627  crossref
  2. S. O. Speranski, “Sharpening complexity results in quantified probability logic”, Logic Journal of the IGPL, 33:3 (2024), jzae114, 21 pp.  crossref
  3. S. L. Kuznetsov, S. O. Speranski, “Infinitary action logic with exponentiation”, Annals of Pure and Applied Logic, 173:2 (2022), 103057, 29 pp.  crossref
  4. S. O. Speranski, “Negation as a modality in a quantified setting”, Journal of Logic and Computation, 31:5 (2021), 1330–1355  crossref
  5. 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
  6. S. O. Speranski, “Notes on the computational aspects of Kripke’s theory of truth”, Studia Logica, 105:2 (2017), 407–429  crossref
  7. S. O. Speranski, “Some new results in monadic second-order arithmetic”, Computability, 4:2 (2015), 159–174  crossref

Recent publications

Presentations in Math-Net.Ru

Personal pages:

Organisations:


© Steklov Math. Inst. of RAS, 2025