Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages

DOI10.1093/logcom/exaa041OpenAlexW4256034450MaRDI QIDQ5140314

Dmitry Shkatov, Mikhail Rybakov

Publication date: 15 December 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.11811

zbMATH Keywords

undecidabilityfirst-order modal logicpredicate modal logicrecursive enumerabilityrestricted languagesfinite Kripke frames

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (5)

Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? ⋮ Are bundles good deals for first-order modal logic?

This page was built for publication: Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages