Recursive enumerability and elementary frame definability in predicate modal logic

DOI10.1093/logcom/exz028OpenAlexW2990466353WikidataQ126662741 ScholiaQ126662741MaRDI QIDQ5112647

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)

Related Items (3)

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 ⋮ A simple example of blocking the Craig trick

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