Stanislav O. Speranski

According to our database, Stanislav O. Speranski authored at least 14 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Sharpening complexity results in quantified probability logic.

Stanislav O. Speranski

Log. J. IGPL, 2025

2023

Infinitary Action Logic with Multiplexing.

Stepan L. Kuznetsov, Stanislav O. Speranski

Stud Logica, April, 2023

2022

Infinitary action logic with exponentiation.

Stepan L. Kuznetsov, Stanislav O. Speranski

Ann. Pure Appl. Log., 2022

2021

Negation as a modality in a quantified setting.

Stanislav O. Speranski

J. Log. Comput., 2021

2020

Belnap-Dunn Modal Logics: Truth constants vs. Truth Values.

Sergei P. Odintsov, Stanislav O. Speranski

Rev. Symb. Log., 2020

2019

Reasoning about Arbitrary Natural Numbers from a Carnapian Perspective.

Leon Horsten, Stanislav O. Speranski

J. Philos. Log., 2019

2018

Hintikka's Independence-Friendly Logic Meets Nelson's Realizability.

Sergei P. Odintsov, Stanislav O. Speranski, Igor Shevchenko

Stud Logica, 2018

2017

Notes on the Computational Aspects of Kripke's Theory of Truth.

Stanislav O. Speranski

Stud Logica, 2017

Quantifying over events in probability logic: an introduction.

Stanislav O. Speranski

Math. Struct. Comput. Sci., 2017

2016

A note on hereditarily Π10- and Σ10-complete sets of sentences.

Stanislav O. Speranski

J. Log. Comput., 2016

2015

Some new results in monadic second-order arithmetic.

Stanislav O. Speranski

Comput., 2015

2013

Computability Issues for Adaptive Logics in Multi-Consequence Standard Format.

Sergei P. Odintsov, Stanislav O. Speranski

Stud Logica, 2013

Complexity for probability logic with quantifiers over propositions.

Stanislav O. Speranski

J. Log. Comput., 2013

A note on definability in fragments of arithmetic with free unary predicates.

Stanislav O. Speranski

Arch. Math. Log., 2013