Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
From MaRDI portal
Publication:631075
DOI10.1016/j.jal.2010.08.010zbMath1215.03031OpenAlexW2052267452MaRDI QIDQ631075
Publication date: 22 March 2011
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2010.08.010
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modal resolution in clausal form
- Generalized quantifiers and modal logic
- SAT-based decision procedures for classical modal logics
- Interpolation for extended modal languages
- Expressive Power and Decidability for Memory Logics
- Resolution calculi for modal logics
- Using the Universal Modality: Gains and Questions
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal K
This page was built for publication: Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)