Inductive sequents for distributive modal logic
From MaRDI portal
Cites work
- A Multi-type Calculus for Inquisitive Logic
- A new proof of Sahlqvist's theorem on modal definability and completeness
- A proof-theoretic semantic analysis of dynamic epistemic logic
- A Sahlqvist theorem for distributive modal logic
- Algorithmic correspondence and canonicity for distributive modal logic
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Algorithmic correspondence for intuitionistic modal mu-calculus
- Bilattice logic properly displayed
- Computing circumscription revisited: A reduction algorithm
- Constructive canonicity for lattice-based fixed point logics
- Display logic
- Elementary canonical formulae: extending Sahlqvist's theorem
- scientific article; zbMATH DE number 3499717 (Why is no real title available?)
- scientific article; zbMATH DE number 2196605 (Why is no real title available?)
- Jónsson-style canonicity for ALBA-inequalities
- Multi-type display calculus for propositional dynamic logic
- Multi-type display calculus for semi De Morgan logic
- Non-normal modal logics and conditional logics: semantic analysis and proof theory
- On Sahlqvist theory for hybrid logics
- On the canonicity of Sahlqvist identities
- Proper multi-type display calculi for rough algebras
- Sahlqvist theory for impossible worlds
- Unified correspondence as a proof-theoretic tool
This page was built for publication: Inductive sequents for distributive modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873876)