18 citations to 10.1093/jigpal/jzy014 (Crossref Cited-By Service)
  1. Mikhail Rybakov, Dmitry Shkatov, Proceedings of the South African Institute of Computer Scientists and Information Technologists 2019, 2019, 1  crossref
  2. Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of products with K”, Journal of Logic and Computation, 31, № 2, 2021, 426  crossref
  3. 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  crossref
  4. Mikhail Rybakov, “Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness”, Logic Journal of the IGPL, 2023, jzad002  crossref
  5. Dmitry Shkatov, Clint J. Van Alten, “Complexity of the Universal Theory of Modal Algebras”, Stud Logica, 108, № 2, 2020, 221  crossref
  6. Mikhail Rybakov, Dmitry Shkatov, “Undecidability of QLTL and QCTL with two variables and one monadic predicate letter”, LI, 27, № 2, 2021, 93  crossref
  7. Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of propositional temporal and modal logics of computation”, Theoretical Computer Science, 925, 2022, 45  crossref
  8. Mikhail Rybakov, Dmitry Shkatov, Conference of the South African Institute of Computer Scientists and Information Technologists 2020, 2020, 58  crossref
  9. 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  crossref
  10. 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  crossref
1
2
Следующая