Mikhail N. Rybakov

36 papers B 5C 1Journal 27Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2025 J jnl
Polytime embedding of intuitionistic modal logics into their one-variable fragments.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2025 J jnl
Variations on the Kripke Trick.
Stud Logica
Mikhail N. Rybakov, Dmitry Shkatov
2024 B conf
On the System of Positive Slices in the Structure of Superintuitionistic Predicate Logics.
AiML
Mikhail N. Rybakov, Dmitry Shkatov, Dmitrij P. Skvortsov
2024 J jnl
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness.
Log. J. IGPL
Mikhail N. Rybakov
2023 J jnl
Algorithmic properties of QK4.3 and QS4.3.
CoRR
Mikhail N. Rybakov, Dmitry Shkatov
2023 J jnl
Complexity function and complexity of validity of modal and superintuitionistic propositional logics.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2022 J jnl
Complexity of finite-variable fragments of products with non-transitive modal logics.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2022 J jnl
Complexity of finite-variable fragments of propositional temporal and modal logics of computation.
Theor. Comput. Sci.
Mikhail N. Rybakov, Dmitry Shkatov
2022 J jnl
Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.
Stud Logica
Mikhail N. Rybakov, Dmitry Shkatov
2022 J jnl
Undecidability of the Logic of Partial Quasiary Predicates.
Log. J. IGPL
Mikhail N. Rybakov, Dmitry Shkatov
2021 J jnl
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages.
CoRR
Mikhail N. Rybakov, Dmitry Shkatov
2021 J jnl
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2021 J jnl
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2021 J jnl
Complexity of finite-variable fragments of products with K.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2020 B conf
Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages.
AiML
Mikhail N. Rybakov, Dmitry Shkatov
2020 J jnl
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2020 — conf
Computational properties of the logic of partial quasiary predicates.
SAICSIT
Mikhail N. Rybakov, Dmitry Shkatov
2020 J jnl
Recursive enumerability and elementary frame definability in predicate modal logic.
J. Log. Comput.
Mikhail N. Rybakov, Dmitry Shkatov
2019 J jnl
Complexity and expressivity of propositional dynamic logics with finitely many variables.
CoRR
Mikhail N. Rybakov, Dmitry Shkatov
2019 J jnl
Complexity of finite-variable fragments of propositional modal logics of symmetric frames.
CoRR
Mikhail N. Rybakov, Dmitry Shkatov
2019 J jnl
Complexity of finite-variable fragments of propositional modal logics of symmetric frames.
Log. J. IGPL
Mikhail N. Rybakov, Dmitry Shkatov
2019 J jnl
Recursive enumerability and elementary frame definability in predicate modal logic.
CoRR
Mikhail N. Rybakov, Dmitry Shkatov
2019 — conf
Trakhtenbrot theorem for classical languages with three individual variables.
SAICSIT
Mikhail N. Rybakov, Dmitry Shkatov
2019 J jnl
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.
Stud Logica
Mikhail N. Rybakov, Dmitry Shkatov
2018 B conf
A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames.
Advances in Modal Logic
Mikhail N. Rybakov, Dmitry Shkatov
2018 C conf
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables.
ICTAC
Mikhail N. Rybakov, Dmitry Shkatov
2018 J jnl
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables.
CoRR
Mikhail N. Rybakov, Dmitry Shkatov
2018 J jnl
Complexity and expressivity of propositional dynamic logics with finitely many variables.
Log. J. IGPL
Mikhail N. Rybakov, Dmitry Shkatov
2018 — conf
On complexity of propositional linear-time temporal logic with finitely many variables.
SAICSIT
Mikhail N. Rybakov, Dmitry Shkatov
2017 J jnl
Complexity of propositional Linear-time Temporal Logic with finitely many variables.
CoRR
Mikhail N. Rybakov, Dmitry Shkatov
2017 J jnl
Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter.
CoRR
Mikhail N. Rybakov, Dmitry Shkatov
2008 J jnl
Complexity of intuitionistic propositional logic and its fragments.
J. Appl. Non Class. Logics
Mikhail N. Rybakov
2007 J jnl
Complexity of finite-variable fragments M of EXPTIME-complete logics.
J. Appl. Non Class. Logics
Mikhail N. Rybakov
2006 B conf
Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables.
Advances in Modal Logic
Mikhail N. Rybakov
2002 B conf
How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics.
Advances in Modal Logic
Alexander V. Chagrov, Mikhail N. Rybakov