The succinctness of the cover modality
From MaRDI portal
Publication:4586149
DOI10.1080/11663081.2016.1144016zbMATH Open1398.03099OpenAlexW2339697109MaRDI QIDQ4586149FDOQ4586149
Authors: Petar Iliev, Hans 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
Recommendations
Logics of knowledge and belief (including belief change) (03B42) Modal logic (including the logic of norms) (03B45)
Cites Work
- Modal logic
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Finite models constructed from canonical formulas
- Completeness for the coalgebraic cover modality
- Automata for the modal \(\mu \)-calculus and related results
- On the succinctness of some modal logics
- An \(n!\) lower bound on formula size
- The succinctness of first-order logic on linear orders
- Uniform interpolation for monotone modal logic
- Title not available (Why is that?)
- Some exponential lower bounds on formula-size in modal logic
- A Note on Uniform Interpolation Proofs in Modal Deep Inference Calculi
- On the size of shortest modal descriptions
Cited In (4)
This page was built for publication: The succinctness of the cover modality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4586149)