Algorithmic correspondence and canonicity for distributive modal logic

DOI10.1016/J.APAL.2011.10.004MaRDI QIDQ409328zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

modal logicdistributive latticecanonicityalgorithmic correspondenceShalqvist correspondence

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logical aspects of lattices and related structures (03G10) Complete distributivity (06D10) Lattices and duality (06D50)

Recommendations

• Algorithmic correspondence and canonicity for non-distributive logics
• A Sahlqvist theorem for distributive modal logic
• Canonicity results for mu-calculi: an algorithmic approach
• Jónsson-style canonicity for ALBA-inequalities
• Algorithmic correspondence for intuitionistic modal mu-calculus

Cites work

• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 3950488 (Why is no real title available?)
• scientific article; zbMATH DE number 4041866 (Why is no real title available?)
• scientific article; zbMATH DE number 3463628 (Why is no real title available?)
• scientific article; zbMATH DE number 3499717 (Why is no real title available?)
• scientific article; zbMATH DE number 1989654 (Why is no real title available?)
• scientific article; zbMATH DE number 1852922 (Why is no real title available?)
• scientific article; zbMATH DE number 2196605 (Why is no real title available?)
• A Sahlqvist theorem for distributive modal logic
• Algebraic modal correspondence: Sahlqvist and beyond
• Algorithmic correspondence and canonicity for distributive modal logic
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Canonical extensions and relational completeness of some substructural logics
• Canonicity results of substructural and lattice-based logics
• Categorial inference and modal logic
• Completeness and correspondence in hybrid logic via an extension of SQEMA
• Constructive canonicity in non-classical logics
• Elementary canonical formulae: extending Sahlqvist's theorem
• Hybrid logics with Sahlqvist axioms
• Modal frame correspondences and fixed-points
• On the canonicity of Sahlqvist identities
• Positive modal logic
• Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic
• Residuated lattices. An algebraic glimpse at substructural logics
• Sahlqvist formulas in hybrid polyadic modal logics
• The truth about algorithmic problems in correspondence theory

Cited in

(47)

• Sahlqvist theory for impossible worlds
• Canonical extensions and ultraproducts of polarities
• Hyper-MacNeille completions of Heyting algebras
• Syntactic Completeness of Proper Display Calculi
• Hypersequent and display calculi -- a unified perspective
• Algebraic proof theory for substructural logics: cut-elimination and completions
• Algebraic semantics and model completeness for intuitionistic public announcement logic
• Power and limits of structural display rules
• Proper multi-type display calculi for rough algebras
• Algebraic proof theory for LE-logics
• Canonical extensions and Kripke-Galois semantics for non-distributive logics
• Probabilistic Epistemic Updates on Algebras
• Modal reduction principles: a parametric shift to graphs
• Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
• Algorithmic correspondence and canonicity for distributive modal logic
• Algorithmic Sahlqvist preservation for modal compact Hausdorff spaces
• Modal inverse correspondence via ALBA
• Sahlqvist via translation
• scientific article; zbMATH DE number 6863657 (Why is no real title available?)
• Categories: how I learned to stop worrying and love two sorts
• Subordination algebras as semantic environment of input/output logic
• Disentangling structural connectives or life without display property
• Canonicity results for mu-calculi: an algorithmic approach
• Dual characterizations for finite lattices via correspondence theory for monotone modal logic
• Algebraic modal correspondence: Sahlqvist and beyond
• Algebraic proof theory: hypersequents and hypercompletions
• A Sahlqvist theorem for distributive modal logic
• Algorithmic correspondence and canonicity for possibility semantics
• Correspondence theory for generalized modal algebras
• THE LOGIC OF RESOURCES AND CAPABILITIES
• Jónsson-style canonicity in distributive modal µ-calculus
• Correspondence and canonicity theory of quasi-inequalities and \(\varPi_2\)-statements in modal subordination algebras
• Polynomial-time checking of generalized Sahlqvist syntactic shape
• scientific article; zbMATH DE number 7243670 (Why is no real title available?)
• Labelled calculi for lattice-based modal logics
• A Sahlqvist theorem for substructural logic
• Algorithmic correspondence for intuitionistic modal mu-calculus
• Order-dual relational semantics for non-distributive propositional logics: a general framework
• Correspondence theory for modal Fairtlough-Mendler semantics of intuitionistic modal logic
• Linear Logic Properly Displayed
• Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}
• Topological duality and algebraic completions
• The bounded proof property via step algebras and step frames
• Taming paraconsistent (and other) logics: an algorithmic approach
• Distributive laws in residuated binars
• Algorithmic correspondence and analytic rules
• Algorithmic correspondence and canonicity for non-distributive logics

Describes a project that uses

Uses Software

• SQEMA

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)