Mikhail N. Rybakov
Orcid: 0000-0002-1491-1310Affiliations:
- Tver State University, Russia
According to our database1,
Mikhail N. Rybakov
authored at least 24 papers
between 2002 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2023
Complexity function and complexity of validity of modal and superintuitionistic propositional logics.
J. Log. Comput., October, 2023
2022
Complexity of finite-variable fragments of propositional temporal and modal logics of computation.
Theor. Comput. Sci., 2022
Correction to: Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.
Stud Logica, 2022
Complexity of finite-variable fragments of products with non-transitive modal logics.
J. Log. Comput., 2022
2021
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages.
J. Log. Comput., 2021
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages.
J. Log. Comput., 2021
2020
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages.
J. Log. Comput., 2020
J. Log. Comput., 2020
Proceedings of the SAICSIT '20: Conference of the South African Institute of Computer Scientists and Information Technologists 2020, 2020
Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages.
Proceedings of the 13th Conference on Advances in Modal Logic, 2020
2019
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.
Stud Logica, 2019
Complexity of finite-variable fragments of propositional modal logics of symmetric frames.
Log. J. IGPL, 2019
Proceedings of the South African Institute of Computer Scientists and Information Technologists, 2019
2018
Complexity and expressivity of propositional dynamic logics with finitely many variables.
Log. J. IGPL, 2018
On complexity of propositional linear-time temporal logic with finitely many variables.
Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists, 2018
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018
A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames.
Proceedings of the Advances in Modal Logic 12, 2018
2008
J. Appl. Non Class. Logics, 2008
2007
J. Appl. Non Class. Logics, 2007
2006
Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables.
Proceedings of the Advances in Modal Logic 6, 2006
2002
Proceedings of the Advances in Modal Logic 4, papers from the fourth conference on "Advances in Modal logic," held in Toulouse, France, 30 September, 2002