Labelled calculi for lattice-based modal logics
From MaRDI portal
Publication:6132565
DOI10.1007/978-3-031-26689-8_3MaRDI QIDQ6132565
Andrea de Domenico, Alessandra Palmigiano, Ineke van der Berg, Unnamed Author, Giuseppe Greco, Krishna Manoorkar
Publication date: 17 August 2023
Published in: Logic and Its Applications (Search for Journal in Brave)
non-distributive modal logiclabelled calculialgorithmic correspondence theoryalgorithmic proof theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic correspondence and canonicity for distributive modal logic
- Proof analysis in intermediate logics
- Proof analysis in modal logic
- Handbook of philosophical logic. Vol. 6
- Displaying modal logic
- Algorithmic correspondence and canonicity for non-distributive logics
- Categories: How I Learned to Stop Worrying and Love Two Sorts
- Multi-type display calculus for dynamic epistemic logic
- Rough sets
- Unified correspondence as a proof-theoretic tool
- Non-distributive logics: from semantics to meaning
- Syntactic Completeness of Proper Display Calculi
- Unified Correspondence
- Canonical extensions and relational completeness of some substructural logics
- Bounded lattice expansions
- Rough concepts
- Labelled calculi for the logics of rough concepts
This page was built for publication: Labelled calculi for lattice-based modal logics