Mikhail N. Rybakov

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 27

Top Topics

Universally Quantified

Inference Rules

Top Venues

J. Log. Comput.

Publications

Mikhail N. Rybakov, Dmitry Shkatov
Complexity function and complexity of validity of modal and superintuitionistic propositional logics. J. Log. Comput. 33 (7) (2023)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of QK4.3 and QS4.3. CoRR (2023)
Mikhail N. Rybakov, Dmitry Shkatov
Undecidability of the Logic of Partial Quasiary Predicates. Log. J. IGPL 30 (3) (2022)
Mikhail N. Rybakov, Dmitry Shkatov
Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter. Stud Logica 110 (2) (2022)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of propositional temporal and modal logics of computation. Theor. Comput. Sci. 925 (2022)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of products with non-transitive modal logics. J. Log. Comput. 32 (5) (2022)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. CoRR (2021)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages. J. Log. Comput. 31 (2) (2021)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of products with K. J. Log. Comput. 31 (2) (2021)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. J. Log. Comput. 31 (5) (2021)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages. J. Log. Comput. 30 (7) (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages. AiML (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Recursive enumerability and elementary frame definability in predicate modal logic. J. Log. Comput. 30 (2) (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Computational properties of the logic of partial quasiary predicates. SAICSIT (2020)
Mikhail N. Rybakov, Dmitry Shkatov
Recursive enumerability and elementary frame definability in predicate modal logic. CoRR (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter. Stud Logica 107 (4) (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of propositional modal logics of symmetric frames. CoRR (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of finite-variable fragments of propositional modal logics of symmetric frames. Log. J. IGPL 27 (1) (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Trakhtenbrot theorem for classical languages with three individual variables. SAICSIT (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity and expressivity of propositional dynamic logics with finitely many variables. CoRR (2019)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables. ICTAC (2018)
Mikhail N. Rybakov, Dmitry Shkatov
A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames. Advances in Modal Logic (2018)
Mikhail N. Rybakov, Dmitry Shkatov
On complexity of propositional linear-time temporal logic with finitely many variables. SAICSIT (2018)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity and expressivity of propositional dynamic logics with finitely many variables. Log. J. IGPL 26 (5) (2018)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables. CoRR (2018)
Mikhail N. Rybakov, Dmitry Shkatov
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter. CoRR (2017)
Mikhail N. Rybakov, Dmitry Shkatov
Complexity of propositional Linear-time Temporal Logic with finitely many variables. CoRR (2017)
Mikhail N. Rybakov
Complexity of intuitionistic propositional logic and its fragments. J. Appl. Non Class. Logics 18 (2-3) (2008)
Mikhail N. Rybakov
Complexity of finite-variable fragments M of EXPTIME-complete logics. J. Appl. Non Class. Logics 17 (3) (2007)
Mikhail N. Rybakov
Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables. Advances in Modal Logic (2006)
Alexander V. Chagrov, Mikhail N. Rybakov
How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics. Advances in Modal Logic (2002)