- Mikhail Rybakov, Dmitry Shkatov, Proceedings of the South African Institute of Computer Scientists and Information Technologists 2019, 2019, 1
- Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of products with K”, Journal of Logic and Computation, 31, № 2, 2021, 426
- Mikhail Rybakov, Dmitry Shkatov, “Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages”, Journal of Logic and Computation, 31, № 5, 2021, 1266
- Mikhail Rybakov, “Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness”, Logic Journal of the IGPL, 2023, jzad002
- Dmitry Shkatov, Clint J. Van Alten, “Complexity of the Universal Theory of Modal Algebras”, Stud Logica, 108, № 2, 2020, 221
- Mikhail Rybakov, Dmitry Shkatov, “Undecidability of QLTL and QCTL with two variables and one monadic predicate letter”, LI, 27, № 2, 2021, 93
- Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of propositional temporal and modal logics of computation”, Theoretical Computer Science, 925, 2022, 45
- Mikhail Rybakov, Dmitry Shkatov, Conference of the South African Institute of Computer Scientists and Information Technologists 2020, 2020, 58
- Mikhail Rybakov, Dmitry Shkatov, “Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages”, Journal of Logic and Computation, 31, № 2, 2021, 494
- Mikhail Rybakov, Dmitry Shkatov, “Complexity function and complexity of validity of modal and superintuitionistic propositional logics”, Journal of Logic and Computation, 33, № 7, 2023, 1566