The succinctness of the cover modality

DOI10.1080/11663081.2016.1144016zbMath1398.03099OpenAlexW2339697109MaRDI QIDQ4586149

Petar Iliev, Hans P. van Ditmarsch

Publication date: 12 September 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2016.1144016

zbMATH Keywords

modal logicsuccinctnesscover modalitylower bounds on formula size

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logics of knowledge and belief (including belief change) (03B42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the succinctness of some modal logics
• Finite models constructed from canonical formulas
• Applications of matrix methods to the theory of lower bounds in computational complexity
• Completeness for the coalgebraic cover modality
• A Note on Uniform Interpolation Proofs in Modal Deep Inference Calculi
• Automata for the modal μ-calculus and related results
• An n  ! lower bound on formula size
• The succinctness of first-order logic on linear orders

This page was built for publication: The succinctness of the cover modality