Modal Logics with Hard Diamond-Free Fragments

DOI10.1007/978-3-319-27683-0_1zbMath1476.03021arXiv1401.5846OpenAlexW350238845MaRDI QIDQ5283414

Antonis Achilleos

Publication date: 21 July 2017

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitymodal logiclower boundssatisfiabilitymulti-modaldiamond-free fragments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45)

Related Items

Modal Logics with Hard Diamond-Free Fragments

Cites Work

• ExpTime tableau decision procedures for regular grammar logics with converse
• Generalized modal satisfiability
• A guide to completeness and complexity for modal logics of knowledge and belief
• Multi-dimensional modal logic
• Many-dimensional modal logics: theory and applications
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• Deciding regular grammar logics with converse through first-order logic
• The Complexity of Poor Man's Logic
• NEXP-Completeness and Universal Hardness Results for Justification Logic
• THE LOGIC OF JUSTIFICATION
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The Complexity of Regularity in Grammar Logics and Related Modal Logics
• Modal Logics with Hard Diamond-Free Fragments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item