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

DOI10.1016/J.JAL.2010.08.002zbMATH Open1214.03011OpenAlexW1987652121MaRDI QIDQ631077FDOQ631077

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

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

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)

Cites Work

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

Cited In (10)

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

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)