Algorithmic correspondence and canonicity for distributive modal logic
From MaRDI portal
Publication:409328
DOI10.1016/J.APAL.2011.10.004zbMATH Open1255.03030OpenAlexW1970051856MaRDI QIDQ409328FDOQ409328
Authors: 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
Recommendations
Modal logic (including the logic of norms) (03B45) Logical aspects of lattices and related structures (03G10) Complete distributivity (06D10) Lattices and duality (06D50)
Cites Work
- Title not available (Why is that?)
- Positive modal logic
- Residuated lattices. An algebraic glimpse at substructural logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Canonical extensions and relational completeness of some substructural logics
- Constructive canonicity in non-classical logics
- Canonicity results of substructural and lattice-based logics
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Title not available (Why is that?)
- Algorithmic correspondence and canonicity for distributive modal logic
- Categorial inference and modal logic
- On the canonicity of Sahlqvist identities
- 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
- The truth about algorithmic problems in correspondence theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Hybrid logics with Sahlqvist axioms
- A Sahlqvist theorem for distributive modal logic
Cited In (44)
- Algebraic semantics and model completeness for intuitionistic public announcement logic
- Algorithmic correspondence and canonicity for distributive modal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Labelled calculi for lattice-based modal logics
- Syntactic Completeness of Proper Display Calculi
- Probabilistic Epistemic Updates on Algebras
- Algebraic proof theory for substructural logics: cut-elimination and completions
- A Sahlqvist theorem for distributive modal logic
- Algorithmic correspondence and canonicity for possibility semantics
- Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
- Subordination algebras as semantic environment of input/output logic
- Algebraic proof theory: hypersequents and hypercompletions
- Canonical extensions and Kripke-Galois semantics for non-distributive logics
- Order-dual relational semantics for non-distributive propositional logics: a general framework
- Taming paraconsistent (and other) logics: an algorithmic approach
- Proper multi-type display calculi for rough algebras
- Sahlqvist via translation
- Correspondence theory for generalized modal algebras
- Hypersequent and display calculi -- a unified perspective
- Algebraic modal correspondence: Sahlqvist and beyond
- Power and limits of structural display rules
- Polynomial-time checking of generalized Sahlqvist syntactic shape
- Correspondence theory for modal Fairtlough-Mendler semantics of intuitionistic modal logic
- Sahlqvist theory for impossible worlds
- Algorithmic correspondence for intuitionistic modal mu-calculus
- Canonical extensions and ultraproducts of polarities
- Hyper-MacNeille completions of Heyting algebras
- Categories: how I learned to stop worrying and love two sorts
- A Sahlqvist theorem for substructural logic
- Linear Logic Properly Displayed
- Canonicity results for mu-calculi: an algorithmic approach
- Dual characterizations for finite lattices via correspondence theory for monotone modal logic
- The bounded proof property via step algebras and step frames
- Algebraic proof theory for LE-logics
- Modal reduction principles: a parametric shift to graphs
- Algorithmic Sahlqvist preservation for modal compact Hausdorff spaces
- THE LOGIC OF RESOURCES AND CAPABILITIES
- Jónsson-style canonicity in distributive modal µ-calculus
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}
- Algorithmic correspondence and canonicity for non-distributive logics
- Disentangling structural connectives or life without display property
- Topological duality and algebraic completions
- Distributive laws in residuated binars
Uses Software
This page was built for publication: Algorithmic correspondence and canonicity for distributive modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409328)
