Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}

DOI10.1007/978-3-030-88701-8_8OpenAlexW3208593457MaRDI QIDQ2695349

Willem Conradie, Peter Jipsen, Valentin F. Goranko

Publication date: 30 March 2023

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• SQEMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic correspondence and canonicity for distributive modal logic
• A Sahlqvist theorem for distributive modal logic
• Residuated lattices. An algebraic glimpse at substructural logics
• On the canonicity of Sahlqvist identities
• Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras
• On Sahlqvist formulas in relevant logic
• Handbook of philosophical logic. Vol. 5
• A Sahlqvist theorem for relevant modal logics
• Duality for algebras of relevant logics
• Algorithmic correspondence and canonicity for non-distributive logics
• Coalgebraic completeness-via-canonicity for distributive substructural logics
• The semantics and proof theory of the logic of bunched implications
• Elementary canonical formulae: extending Sahlqvist's theorem
• Sahlqvist Formulas in Hybrid Polyadic Modal Logics
• CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS
• POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS
• RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
• Some Varieties Containing Relation Algebras
• A new proof of Sahlqvist's theorem on modal definability and completeness
• Bounded distributive lattice expansions
• A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC
• Arrows Pointing at Arrows: Arrow Logic, Relevance Logic, and Relation Algebras
• Unified Correspondence
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• RELEVANCE LOGICS AND RELATION ALGEBRAS
• Canonical extensions and relational completeness of some substructural logics
• Handbook of philosophical logic. Vol. 3.

This page was built for publication: Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}