Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
From MaRDI portal
Publication:3431963
DOI10.1093/logcom/exl026zbMath1128.03005MaRDI QIDQ3431963
Willem Conradie, Valentin F. 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
completeness; hybrid logic; canonicity; algorithm SQEMA; first-order correspondence; polyadic modal logic
03B45: Modal logic (including the logic of norms)
03B35: Mechanization of proofs and logical operations
Related Items
Unnamed Item, Unnamed Item, Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA, Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$, Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA, Algebraic modal correspondence: Sahlqvist and beyond, Elementary canonical formulae: extending Sahlqvist's theorem, Converse-PDL with regular inclusion axioms: a framework for MAS logics, IV. Semantic extensions of SQEMA, Towards incorporating background theories into quantifier elimination
Uses Software