Recursive enumerability and elementary frame definability in predicate modal logic

DOI10.1093/LOGCOM/EXZ028MaRDI QIDQ5112647zbMATH OpenOpenAlexWikidataFDO

Authors Mikhail Rybakov, Dmitry Shkatov

Publication date 4 June 2020

Published in Journal Of Logic And Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1975408
• A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames
• The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable
• Decidable and enumerable predicate logics of provability
• Some incompletable modal predicate logics

Cited in

(7)

• Complexity of finite-variable fragments of propositional temporal and modal logics of computation
• scientific article; zbMATH DE number 1975408 (Why is no real title available?)
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
• Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
• A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames
• Recursive logic frames
• A simple example of blocking the Craig trick

This page was built for publication: Recursive enumerability and elementary frame definability in predicate modal logic

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