Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA

DOI10.1093/LOGCOM/EXL026MaRDI QIDQ3431963zbMATH OpenOpenAlexFDO

Authors Willem Conradie, Valentin Goranko, Dimiter Vakarelov

Publication date 13 April 2007

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exl026

zbMATH Keywords

completenesscanonicityhybrid logicalgorithm SQEMAfirst-order correspondencepolyadic modal logic

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
• IV. Semantic extensions of SQEMA
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
• Completeness and correspondence in hybrid logic via an extension of SQEMA

Cited in

(15)

• Converse-PDL with regular inclusion axioms: a framework for MAS logics
• Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
• Elementary canonical formulae: extending Sahlqvist's theorem
• Algorithmic Sahlqvist preservation for modal compact Hausdorff spaces
• Sahlqvist via translation
• Towards incorporating background theories into quantifier elimination
• Algebraic modal correspondence: Sahlqvist and beyond
• Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
• IV. Semantic extensions of SQEMA
• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
• Deterministic SQEMA and application for pre-contact logic
• Completeness and correspondence in hybrid logic via an extension of SQEMA
• Sahlqvist formulas in hybrid polyadic modal logics
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Algorithmic correspondence and analytic rules

Describes a project that uses

Uses Software

• SQEMA

This page was built for publication: Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA

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