| How many variables does one need to prove PSPACE-hardness of modal logics? AV Chagrov, MN Rybakov Advances in Modal Logic 4 (AiML’02), 2003 | 75* | 2003 |
| Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter M Rybakov, D Shkatov Studia Logica 107 (4), 695-717, 2019 | 46 | 2019 |
| Complexity of finite-variable fragments of propositional modal logics of symmetric frames M Rybakov, D Shkatov Logic Journal of the IGPL 27 (1), 60-68, 2019 | 36 | 2019 |
| Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables. MN Rybakov Advances in Modal Logic 6, 393-411, 2006 | 36 | 2006 |
| Complexity and expressivity of propositional dynamic logics with finitely many variables M Rybakov, D Shkatov Logic Journal of the IGPL 26 (5), 539-547, 2018 | 33 | 2018 |
| Complexity of intuitionistic propositional logic and its fragments M Rybakov Journal of Applied Non-Classical Logics 18 (2-3), 267-292, 2008 | 28 | 2008 |
| Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages M Rybakov, D Shkatov Journal of Logic and Computation 30 (7), 1305-1329, 2020 | 27 | 2020 |
| Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages M Rybakov, D Shkatov Journal of Logic and Computation 31 (2), 494-522, 2021 | 25 | 2021 |
| Complexity and expressivity of branching-and alternating-time temporal logics with finitely many variables M Rybakov, D Shkatov Theoretical Aspects of Computing–ICTAC 2018: 15th International Colloquium …, 2018 | 25 | 2018 |
| Complexity of finite-variable fragments of products with K M Rybakov, D Shkatov Journal of Logic and Computation 31 (2), 426-443, 2021 | 22 | 2021 |
| Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages. MN Rybakov, D Shkatov AiML, 523-539, 2020 | 21 | 2020 |
| A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames. MN Rybakov, D Shkatov Advances in Modal Logic 12, 531-540, 2018 | 21 | 2018 |
| Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages M Rybakov, D Shkatov Journal of Logic and Computation 31 (5), 1266-1288, 2021 | 20 | 2021 |
| Complexity of finite-variable fragments of EXPTIME-complete logics M Rybakov Journal of Applied Non-classical logics 17 (3), 359-382, 2007 | 18 | 2007 |
| Стандартные переводы неклассических формул и относительная разрешимость логик МН Рыбаков, АВ Чагров Труды научно-исследовательского семинара Логического центра Института …, 2000 | 15* | 2000 |
| Recursive enumerability and elementary frame definability in predicate modal logic M Rybakov, D Shkatov Journal of Logic and Computation 30 (2), 549-560, 2020 | 13 | 2020 |
| Complexity of finite-variable fragments of products with non-transitive modal logics M Rybakov, D Shkatov Journal of Logic and Computation 32 (5), 853-870, 2022 | 12 | 2022 |
| Перечислимость модальных предикатных логик и условия обрыва возрастающих цепей МН Рыбаков Логические исследования, 155-168, 2001 | 11* | 2001 |
| Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness M Rybakov Logic Journal of the IGPL 32 (3), 465-492, 2024 | 9 | 2024 |
| Сложность константного фрагмента пропозициональной динамической логики МН Рыбаков Вестник ТвГУ. Серия: Прикладная математика, 5-17, 2007 | 9 | 2007 |
Dmitry ShkatovUniversity of the Witwatersrand, Johannesburg在 wits.ac.za 的电子邮件经过验证
