10 citations to 10.3166/jancl.17.359-382 (Crossref Cited-By Service)

1. Vladimir V. Rybakov, 6882, Knowlege-Based and Intelligent Information and Engineering Systems, 2011, 478  
2. Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of products with K”, Journal of Logic and Computation, 31, no. 2, 2021, 426  
3. Mikhail Rybakov, Dmitry Shkatov, “Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames”, Journal of Logic and Computation, 2024, exad078  
4. M. Rybakov, “Computational Complexity of the Word Problem in Modal and Heyting Algebras with a Small Number of Generators”, Russ Math., 66, no. 5, 2022, 33  
5. Mikhail Rybakov, Dmitry Shkatov, “Complexity function and complexity of validity of modal and superintuitionistic propositional logics”, Journal of Logic and Computation, 33, no. 7, 2023, 1566  
6. Mikhail Rybakov, “Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness”, Logic Journal of the IGPL, 2023, jzad002  
7. Михаил Николаевич Рыбаков, “Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?”, LI, 29, no. 1, 2023, 114  
8. Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of products with non-transitive modal logics”, Journal of Logic and Computation, 32, no. 5, 2022, 853  
9. Vladimir Rybakov, 6278, Knowledge-Based and Intelligent Information and Engineering Systems, 2010, 323  
10. Mikhail Rybakov, Dmitry Shkatov, “Complexity of finite-variable fragments of propositional temporal and modal logics of computation”, Theoretical Computer Science, 925, 2022, 45