Algorithmic correspondence and canonicity for non-distributive logics

DOI10.1016/j.apal.2019.04.003zbMath1477.03046arXiv1603.08515OpenAlexW2964164692WikidataQ128059089 ScholiaQ128059089MaRDI QIDQ2273010

Willem Conradie, Alessandra Palmigiano

Publication date: 18 September 2019

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

modal logicsubstructural logicscanonicityalgorithmic correspondenceSahlqvist correspondencenon-distributive lattices

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Logical aspects of lattices and related structures (03G10) Lattices and duality (06D50) Stone spaces (Boolean spaces) and related structures (06E15) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (21)

Linear Logic Properly Displayed ⋮ Syntactic Completeness of Proper Display Calculi ⋮ Non-normal modal logics and conditional logics: semantic analysis and proof theory ⋮ A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts ⋮ Rough concepts ⋮ Correspondence theory for generalized modal algebras ⋮ Labelled calculi for lattice-based modal logics ⋮ Labelled calculi for the logics of rough concepts ⋮ Subordination algebras as semantic environment of input/output logic ⋮ Positive modal logic beyond distributivity ⋮ Semantic Analysis of Subexponential Modalities in Distributive Non-commutative Linear Logic ⋮ Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} ⋮ Unnamed Item ⋮ Reasoning with Incomplete Information in Generalized Galois Logics Without Distribution: The Case of Negation and Modal Operators ⋮ Semi De Morgan logic properly displayed ⋮ Definable operators on stable set lattices ⋮ Modelling socio-political competition ⋮ Modal translation of substructural logics ⋮ Unnamed Item ⋮ Residuation algebras with functional duals ⋮ Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$

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
• Relational semantics for full linear logic
• Algebraic semantics and model completeness for intuitionistic public announcement logic
• A fresh perspective on canonical extensions for bounded lattices.
• Algorithmic correspondence and canonicity for distributive modal logic
• Sahlqvist correspondence for modal mu-calculus
• Algorithmic correspondence for intuitionistic modal mu-calculus
• TiRS graphs and TiRS frames: a new setting for duals of canonical extensions
• A Sahlqvist theorem for distributive modal logic
• Symmetric categorial grammar
• Generalized Kripke frames
• Residuated lattices. An algebraic glimpse at substructural logics
• On modal logic with an intuitionistic base
• Stone duality for lattices
• On logics with coimplication
• 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
• Semantic analysis of orthologic
• Constructive canonicity for lattice-based fixed point logics
• Lattice logic properly displayed
• Multi-type display calculus for semi De Morgan logic
• Order-dual relational semantics for non-distributive propositional logics: a general framework
• A formalization of the propositional calculus of H-B logic
• Positive modal logic
• Algebraic modal correspondence: Sahlqvist and beyond
• Modal frame correspondences and fixed-points
• Topological duality and lattice expansions. I: A topological construction of canonical extensions.
• Elementary canonical formulae: extending Sahlqvist's theorem
• Categories: How I Learned to Stop Worrying and Love Two Sorts
• A Multi-type Calculus for Inquisitive Logic
• Multi-type display calculus for dynamic epistemic logic
• Multi-type display calculus for propositional dynamic logic
• Dual characterizations for finite lattices via correspondence theory for monotone modal logic
• Canonicity results for mu-calculi: an algorithmic approach
• Sahlqvist theory for impossible worlds
• Jónsson-style canonicity for ALBA-inequalities
• On Sahlqvist theory for hybrid logics
• Unified correspondence and proof theory for strict implication
• A bimodal perspective on possibility semantics
• Semi-de Morgan algebras
• Functional translation and second-order frame properties of modal logics
• THE LOGIC OF RESOURCES AND CAPABILITIES
• Unified correspondence as a proof-theoretic tool
• Order-dual relational semantics for non-distributive propositional logics
• Modal and temporal extensions of non-distributive propositional logics
• A new proof of Sahlqvist's theorem on modal definability and completeness
• Generalized Kripke semantics for the Lambek-Grishin calculus
• A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC
• Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic
• Stone duality for lattice expansions
• Unified Correspondence
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Context Algebras, Context Frames, and Their Discrete Duality
• Hybrid logics with Sahlqvist axioms
• Duality via Truth: Semantic frameworks for lattice-based logics
• Minimal predicates, fixed-points, and definability
• Canonical extensions and relational completeness of some substructural logics
• Boolean Algebras with Operators. Part I
• Algorithmic correspondence and canonicity for possibility semantics
• Bounded lattice expansions

This page was built for publication: Algorithmic correspondence and canonicity for non-distributive logics