Algebraic modal correspondence: Sahlqvist and beyond

DOI10.1016/j.jlamp.2016.10.006OpenAlexW2963646327MaRDI QIDQ2401020

Alessandra Palmigiano, Sumit Sourabh, Willem Conradie

Publication date: 31 August 2017

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.06881

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items

Linear Logic Properly Displayed ⋮ Probabilistic Epistemic Updates on Algebras ⋮ THE LOGIC OF RESOURCES AND CAPABILITIES ⋮ Rough concepts ⋮ Algorithmic correspondence and canonicity for distributive modal logic ⋮ Algorithmic correspondence for intuitionistic modal mu-calculus ⋮ Algorithmic correspondence and canonicity for non-distributive logics ⋮ Unnamed Item ⋮ Hyper-MacNeille completions of Heyting algebras ⋮ Unnamed Item

Uses Software

• SQEMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic correspondence and canonicity for distributive modal logic
• Sahlqvist correspondence for modal mu-calculus
• Algorithmic correspondence for intuitionistic modal mu-calculus
• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
• A Sahlqvist theorem for distributive modal logic
• Residuated lattices. An algebraic glimpse at substructural logics
• 25 years of model checking. History, achievements, perspectives
• Categorial inference and modal logic
• Tools and techniques in modal logic
• On the canonicity of Sahlqvist identities
• Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras
• Constructive canonicity in non-classical logics
• Game logic -- an overview
• Constructive canonicity for lattice-based fixed point logics
• Modal frame correspondences and fixed-points
• Elementary canonical formulae: extending Sahlqvist's theorem
• Extending Boolean operations
• Varieties of complex algebras
• Categories: How I Learned to Stop Worrying and Love Two Sorts
• The canonical FEP construction
• Sahlqvist preservation for topological fixed-point logic
• A Van Benthem/Rosen theorem for coalgebraic predicate logic
• Sahlqvist theory for impossible worlds
• Jónsson-style canonicity for ALBA-inequalities
• CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS
• Coalgebraic Predicate Logic
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• Modalities in Sociological Arguments
• IV. Semantic extensions of SQEMA
• On the strength and scope of DLS
• Reduction of second‐order logic to modal logic
• Modal reduction principles
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• Functional translation and second-order frame properties of modal logics
• A new proof of Sahlqvist's theorem on modal definability and completeness
• An incompleteness theorem in modal logic
• Unified Correspondence
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Hybrid logics with Sahlqvist axioms
• Relational and Kleene-Algebraic Methods in Computer Science
• Canonical extensions and relational completeness of some substructural logics
• Boolean Algebras with Operators. Part I