Satisfiability versus Finite Satisfiability in Elementary Modal Logics

DOI10.3233/FI-2018-1736MaRDI QIDQ4611207zbMATHOpenAlexWikidataFDO

Authors Jakub Michaliszyn, Jan Otop, Piotr Witkowski

Publication date 17 January 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2018-1736

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Recommendations

• Satisfiability vs. finite satisfiability in elementary modal logics
• On the decidability of elementary modal logics
• On the complexity of elementary modal logics
• Modal logic over finite structures
• scientific article; zbMATH DE number 6302919
• Satisfiability of modal inclusion logic. Lax and strict semantics
• Some results on finite axiomatizability in modal logic
• Elementary definability and completeness in general and positive modal logic
• From Propositional Satisfiability to Satisfiability Modulo Theories

Cited in

(8)

• Elementary modal logics over transitive structures
• A case for satisfaction classes: model theoretic vs axiomatic approaches to the notion of truth
• Modal logics definable by universal three-variable formulas
• Satisfiability vs. finite satisfiability in elementary modal logics
• On the decidability of elementary modal logics
• The complexity of decomposing modal and first-order theories
• Decidable elementary modal logics
• scientific article; zbMATH DE number 6302919 (Why is no real title available?)

This page was built for publication: Satisfiability versus Finite Satisfiability in Elementary Modal Logics

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