9 citations to 10.1007/978-3-030-02508-3_21 (Crossref Cited-By Service)

1. Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of products with K”, Journal of Logic and Computation, 31, № 2, 2021, 426  
2. Mikhail Rybakov, Dmitry Shkatov, Conference of the South African Institute of Computer Scientists and Information Technologists 2020, 2020, 58  
3. Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of products with non-transitive modal logics”, Journal of Logic and Computation, 32, № 5, 2022, 853  
4. Mikhail Rybakov, Dmitry Shkatov, “Undecidability of QLTL and QCTL with two variables and one monadic predicate letter”, LI, 27, № 2, 2021, 93  
5. 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  
6. M. Rybakov, “Computational Complexity of the Word Problem in Modal and Heyting Algebras with a Small Number of Generators”, Russ Math., 66, № 5, 2022, 33  
7. Mikhail Rybakov, Dmitry Shkatov, “Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages”, Journal of Logic and Computation, 30, № 7, 2020, 1305  
8. Mikhail Rybakov, “Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness”, Logic Journal of the IGPL, 2023, jzad002  
9. Mikhail Rybakov, Dmitry Shkatov, “Undecidability of the Logic of Partial Quasiary Predicates”, Logic Journal of the IGPL, 30, № 3, 2022, 519