Publication:3382820

DOI10.1093/LOGCOM/EXAB030OpenAlexW3080946754MaRDI QIDQ3382820FDOQ3382820

Mikhail Rybakov, Dmitry Shkatov

Publication date: 22 September 2021

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

decidabilityundecidabilityfirst-order modal logicpredicate modal logicrecursive enumerabilityrestricted languageslinear Kripke frames

Mathematics Subject Classification ID

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

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382820)