Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
DOI10.1016/J.JAL.2010.08.010zbMATH Open1215.03031OpenAlexW2052267452MaRDI QIDQ631075FDOQ631075
Authors: Carlos Areces, Daniel Gorín 
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)
Cites Work
- Modal logic
- Using the Universal Modality: Gains and Questions
- Handbook of modal logic
- Interpolation for extended modal languages
- Computing small clause normal forms
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Handbook of automated reasoning. In 2 vols
- Normal form transformations
- Expressive Power and Decidability for Memory Logics
- Generalized quantifiers and modal logic
- On the complexity of fragments of modal logics
- Modal resolution in clausal form
- SAT-based decision procedures for classical modal logics
- Resolution calculi for modal logics
- Title not available (Why is that?)
- Building decision procedures for modal logics from propositional decision procedures -- the case study of modal K
Cited In (4)
This page was built for publication: Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631075)
