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

DOI10.1007/978-3-030-71430-7_4MaRDI QIDQ5027233zbMATH OpenOpenAlexFDO

Authors Willem Conradie, Valentin 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

algorithmic correspondenceinductive formulaerelevance logicRoutley-Meyer relational semantics

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for relevant logic
• scientific article; zbMATH DE number 2226185
• Algorithmic correspondence and canonicity for non-distributive logics
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions

Cites work

• A Sahlqvist theorem for distributive modal logic
• A Sahlqvist theorem for relevant modal logics
• Algorithmic correspondence and canonicity for distributive modal logic
• Algorithmic correspondence and canonicity for non-distributive logics
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
• Algorithmic correspondence for intuitionistic modal mu-calculus
• Duality for algebras of relevant logics
• Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects
• Elementary canonical formulae: extending Sahlqvist's theorem
• Handbook of philosophical logic. Vol. 6
• scientific article; zbMATH DE number 3926879 (Why is no real title available?)
• scientific article; zbMATH DE number 3496100 (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 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 1852922 (Why is no real title available?)
• IV. Semantic extensions of SQEMA
• Jónsson-style canonicity for ALBA-inequalities
• Modal logic
• Nonassociative right hoops
• On Sahlqvist formulas in relevant logic
• Sahlqvist formulas in hybrid polyadic modal logics
• Semantics for relevant logics
• Unified correspondence
• Untersuchungen über das Eliminationsproblem der mathematischen Logik

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027233)