Modal logics with hard diamond-free fragments

DOI10.1093/LOGCOM/EXAA001OpenAlexW3008086539WikidataQ126399225 ScholiaQ126399225MaRDI QIDQ5108014

Antonis Achilleos

Publication date: 29 April 2020

Published in: Journal Of Logic And Computation (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)

Recommendations

• On non-self-referential fragments of modal logics 👍 👎
• Modal languages and bounded fragments of predicate logic 👍 👎
• The monodic fragment of propositional term modal logic 👍 👎
• Decidable fragments of first-order modal logics 👍 👎
• Modal Logics with Hard Diamond-Free Fragments 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

This page was built for publication: Modal logics with hard diamond-free fragments