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

DOI10.1016/J.JAL.2010.08.002MaRDI QIDQ631077zbMATH OpenOpenAlexFDO

Authors Willem Conradie, Valentin 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 logiccanonicitycorrespondence theoryfirst-order logic with fixed-pointsSQEMA

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Recommendations

• IV. Semantic extensions of SQEMA
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• Completeness and correspondence in hybrid logic via an extension of SQEMA

Cites work

• scientific article; zbMATH DE number 3499717 (Why is no real title available?)
• scientific article; zbMATH DE number 1028833 (Why is no real title available?)
• scientific article; zbMATH DE number 1989654 (Why is no real title available?)
• scientific article; zbMATH DE number 1765663 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 2196605 (Why is no real title available?)
• A zero-one law for logic with a fixed-point operator
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
• Computing circumscription revisited: A reduction algorithm
• Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects
• Elementary canonical formulae: extending Sahlqvist's theorem
• Elements of finite model theory.
• Handbook of modal logic
• IV. Semantic extensions of SQEMA
• Minimal predicates, fixed-points, and definability
• Modal frame correspondences and fixed-points
• Modal logic
• Rudiments of \(\mu\)-calculus
• Sahlqvist formulas in hybrid polyadic modal logics
• Second-order quantifier elimination. Foundations, computational aspects and applications
• The modal logic of the countable random frame

Cited in

(10)

• Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
• Sahlqvist theorem for modal fixed point logic
• Algebraic modal correspondence: Sahlqvist and beyond
• Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
• Sahlqvist correspondence for modal mu-calculus
• IV. Semantic extensions of SQEMA
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• Deterministic SQEMA and application for pre-contact logic
• Algorithmic correspondence for intuitionistic modal mu-calculus
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

Describes a project that uses

Uses Software

• SQEMA

This page was built for publication: Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA

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