The succinctness of the cover modality
From MaRDI portal
Publication:4586149
Recommendations
Cites work
- scientific article; zbMATH DE number 2196605 (Why is no real title available?)
- A Note on Uniform Interpolation Proofs in Modal Deep Inference Calculi
- An \(n!\) lower bound on formula size
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Automata for the modal \(\mu \)-calculus and related results
- Completeness for the coalgebraic cover modality
- Finite models constructed from canonical formulas
- Modal logic
- On the size of shortest modal descriptions
- On the succinctness of some modal logics
- Some exponential lower bounds on formula-size in modal logic
- The succinctness of first-order logic on linear orders
- Uniform interpolation for monotone modal logic
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)