Algorithmic correspondence and canonicity for distributive modal logic
From MaRDI portal
Publication:409328
DOI10.1016/j.apal.2011.10.004zbMath1255.03030OpenAlexW1970051856MaRDI QIDQ409328
Willem Conradie, Alessandra Palmigiano
Publication date: 13 April 2012
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.10.004
Complete distributivity (06D10) Modal logic (including the logic of norms) (03B45) Logical aspects of lattices and related structures (03G10) Lattices and duality (06D50)
Related Items
Power and Limits of Structural Display Rules, Linear Logic Properly Displayed, Canonical extensions and Kripke-Galois semantics for non-distributive logics, Syntactic Completeness of Proper Display Calculi, Probabilistic Epistemic Updates on Algebras, Algebraic modal correspondence: Sahlqvist and beyond, THE LOGIC OF RESOURCES AND CAPABILITIES, Taming Paraconsistent (and Other) Logics, Algebraic semantics and model completeness for intuitionistic public announcement logic, Correspondence theory for modal Fairtlough-Mendler semantics of intuitionistic modal logic, Disentangling structural connectives or life without display property, Algebraic proof theory for substructural logics: cut-elimination and completions, Algorithmic correspondence and canonicity for distributive modal logic, Correspondence theory for generalized modal algebras, Topological duality and algebraic completions, Labelled calculi for lattice-based modal logics, Subordination algebras as semantic environment of input/output logic, Order-dual relational semantics for non-distributive propositional logics: a general framework, Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}, Algorithmic correspondence for intuitionistic modal mu-calculus, Hypersequent and display calculi -- a unified perspective, Distributive laws in residuated binars, A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC, Algorithmic correspondence and canonicity for non-distributive logics, Algebraic proof theory: hypersequents and hypercompletions, Canonical extensions and ultraproducts of polarities, The bounded proof property via step algebras and step frames, Unnamed Item, Categories: How I Learned to Stop Worrying and Love Two Sorts, Hyper-MacNeille completions of Heyting algebras, Unnamed Item, Proper multi-type display calculi for rough algebras, Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
Uses Software
Cites Work
- Algorithmic correspondence and canonicity for distributive modal logic
- A Sahlqvist theorem for distributive modal logic
- Residuated lattices. An algebraic glimpse at substructural logics
- Categorial inference and modal logic
- On the canonicity of Sahlqvist identities
- Constructive canonicity in non-classical logics
- Positive modal logic
- Algebraic modal correspondence: Sahlqvist and beyond
- Modal frame correspondences and fixed-points
- Elementary canonical formulae: extending Sahlqvist's theorem
- Sahlqvist Formulas in Hybrid Polyadic Modal Logics
- CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS
- Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic
- Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Hybrid logics with Sahlqvist axioms
- Canonical extensions and relational completeness of some substructural logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
