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

DOI10.1093/LOGCOM/EXL026zbMATH Open1128.03005OpenAlexW2051649506MaRDI QIDQ3431963FDOQ3431963

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

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

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)

Cited In (15)

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