Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Ghilardi, Silvio
Nicolini, Enrica
and
Zucchelli, Daniele
2005.
Frontiers of Combining Systems.
Vol. 3717,
Issue. ,
p.
1.
Gabelaia, D.
Kurucz, A.
Wolter, F.
and
Zakharyaschev, M.
2006.
Non-primitive recursive decidability of products of modal logics with expanding domains.
Annals of Pure and Applied Logic,
Vol. 142,
Issue. 1-3,
p.
245.
Kurucz, Agi
2007.
Handbook of Modal Logic.
Vol. 3,
Issue. ,
p.
869.
Rahman, Shahid
and
Tulenheimo, Tero
2009.
Games: Unifying Logic, Language, and Philosophy.
Vol. 15,
Issue. ,
p.
153.
Wolter, Frank
and
Zakharyaschev, Michael
2014.
Leo Esakia on Duality in Modal and Intuitionistic Logics.
Vol. 4,
Issue. ,
p.
99.
Caicedo, Xavier
Metcalfe, George
Rodríguez, Ricardo
and
Rogger, Jonas
2017.
Decidability of order-based modal logics.
Journal of Computer and System Sciences,
Vol. 88,
Issue. ,
p.
53.
Rybakov, Mikhail
and
Shkatov, Dmitry
2019.
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter.
Studia Logica,
Vol. 107,
Issue. 4,
p.
695.
Rybakov, Mikhail
and
Shkatov, Dmitry
2019.
Trakhtenbrot theorem for classical languages with three individual variables.
p.
1.
Forster, Yannick
Kirst, Dominik
and
Smolka, Gert
2019.
On synthetic undecidability in Coq, with an application to the Entscheidungsproblem.
p.
38.
Rybakov, Mikhail
and
Shkatov, Dmitry
2020.
Computational properties of the logic of partial quasiary predicates.
p.
58.
Rybakov, Mikhail
and
Shkatov, Dmitry
2020.
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages.
Journal of Logic and Computation,
Vol. 30,
Issue. 7,
p.
1305.
Rybakov, Mikhail
and
Shkatov, Dmitry
2021.
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter.
Logical Investigations,
Vol. 27,
Issue. 2,
p.
93.
Рыбаков, Михаил Николаевич
and
Шкатов, Дмитрий Петрович
2021.
Неразрешимость логик с унарным предикатом и двумя переменными.
p.
246.
Rybakov, Mikhail
and
Shkatov, Dmitry
2021.
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages.
Journal of Logic and Computation,
Vol. 31,
Issue. 5,
p.
1266.
Rybakov, Mikhail
and
Shkatov, Dmitry
2021.
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages.
Journal of Logic and Computation,
Vol. 31,
Issue. 2,
p.
494.
Rybakov, Mikhail
and
Shkatov, Dmitry
2022.
Complexity of finite-variable fragments of propositional temporal and modal logics of computation.
Theoretical Computer Science,
Vol. 925,
Issue. ,
p.
45.
Caicedo, Xavier
Metcalfe, George
Rodríguez, Ricardo
and
Tuyt, Olim
2022.
One-variable fragments of intermediate logics over linear frames.
Information and Computation,
Vol. 287,
Issue. ,
p.
104755.
Rybakov, M.
2022.
Computational Complexity of Theories of a Binary Predicate with a Small Number of Variables.
Doklady Mathematics,
Vol. 106,
Issue. 3,
p.
458.
Rybakov, Mikhail
and
Shkatov, Dmitry
2022.
Undecidability of the Logic of Partial Quasiary Predicates.
Logic Journal of the IGPL,
Vol. 30,
Issue. 3,
p.
519.
Padmanabha, Anantha
and
Ramanujam, R.
2023.
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic.
ACM Transactions on Computational Logic,
Vol. 24,
Issue. 4,
p.
1.