Decidable elementary modal logics

DOI10.1109/LICS.2012.59MaRDI QIDQ2986825zbMATH OpenOpenAlexWikidataFDO

Authors Jakub Michaliszyn, Jan Otop

Publication date 16 May 2017

Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2012.59

zbMATH Keywords

decidabilitymodal logicelementary logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Recommendations

• On the decidability of elementary modal logics
• Elementary modal logics over transitive structures
• Satisfiability versus Finite Satisfiability in Elementary Modal Logics
• Satisfiability vs. finite satisfiability in elementary modal logics
• On the complexity of elementary modal logics

Cited in

(11)

• On the complexity of elementary modal logics
• Elementary definability and completeness in general and positive modal logic
• Modal logics definable by universal three-variable formulas
• Elementary modal logics over transitive structures
• scientific article; zbMATH DE number 3847361 (Why is no real title available?)
• Decidability of some classes of modal logic
• On the decidability of elementary modal logics
• Decidability of order-based modal logics
• Kripke completeness of strictly positive modal logics over meet-semilattices with operators
• Satisfiability vs. finite satisfiability in elementary modal logics
• A dichotomy for some elementarily generated modal logics

This page was built for publication: Decidable elementary modal logics

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