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

DOI10.1093/logcom/exl026zbMath1128.03005OpenAlexW2051649506MaRDI 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

zbMATH Keywords

completeness hybrid logic canonicity algorithm SQEMA first-order correspondence polyadic modal logic

Mathematics Subject Classification ID

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

Related Items (10)

Converse-PDL with regular inclusion axioms: a framework for MAS logics ⋮ Algebraic modal correspondence: Sahlqvist and beyond ⋮ Unnamed Item ⋮ Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA ⋮ Elementary canonical formulae: extending Sahlqvist's theorem ⋮ IV. Semantic extensions of SQEMA ⋮ Towards incorporating background theories into quantifier elimination ⋮ Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA ⋮ Unnamed Item ⋮ Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$

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