Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$

DOI10.1007/978-3-030-71430-7_4OpenAlexW3202755338MaRDI QIDQ5027233

Willem Conradie, Valentin F. Goranko

Publication date: 4 February 2022

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-71430-7_4

zbMATH Keywords

relevance logicalgorithmic correspondenceRoutley-Meyer relational semanticsinductive formulae

Mathematics Subject Classification ID

General logic (03Bxx) Algebraic logic (03Gxx)

Cites Work

• 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
• 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
• On Sahlqvist formulas in relevant logic
• Handbook of philosophical logic. Vol. 6
• A Sahlqvist theorem for relevant modal logics
• Untersuchungen über das Eliminationsproblem der mathematischen Logik
• Duality for algebras of relevant logics
• Algorithmic correspondence and canonicity for non-distributive logics
• Nonassociative right hoops
• Elementary canonical formulae: extending Sahlqvist's theorem
• Sahlqvist Formulas in Hybrid Polyadic Modal Logics
• Jónsson-style canonicity for ALBA-inequalities
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• IV. Semantic extensions of SQEMA
• Unified Correspondence
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Semantics for relevant logics

This page was built for publication: Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$