Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA

DOI10.1016/j.jal.2010.08.002zbMath1214.03011MaRDI QIDQ631077

Willem Conradie, Valentin F. Goranko, Dimiter Vakarelov

Publication date: 22 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.jal.2010.08.002

zbMATH Keywords

modal logic; correspondence theory; canonicity; first-order logic with fixed-points; SQEMA

Mathematics Subject Classification ID

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

03B35: Mechanization of proofs and logical operations

Related Items

Unnamed Item, Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$, Sahlqvist theorem for modal fixed point logic, Sahlqvist correspondence for modal mu-calculus, Algorithmic correspondence for intuitionistic modal mu-calculus, Algebraic modal correspondence: Sahlqvist and beyond

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
• Elements of finite model theory.
• Computing circumscription revisited: A reduction algorithm
• The modal logic of the countable random frame
• Modal frame correspondences and fixed-points
• Elementary canonical formulae: extending Sahlqvist's theorem
• Sahlqvist Formulas in Hybrid Polyadic Modal Logics
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• IV. Semantic extensions of SQEMA
• A zero-one law for logic with a fixed-point operator
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Minimal predicates, fixed-points, and definability
• Rudiments of \(\mu\)-calculus