Sahlqvist Formulas in Hybrid Polyadic Modal Logics

DOI10.1093/logcom/11.5.737zbMath0993.03013OpenAlexW1998532035MaRDI QIDQ2772884

Valentin F. Goranko, Dimiter Vakarelov

Publication date: 19 February 2002

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

first-order definabilitynominalsuniversal modalitySahlqvist formulashybrid polyadic modal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (12)

Notes on logics of metric spaces ⋮ Unnamed Item ⋮ Algorithmic correspondence and canonicity for distributive modal logic ⋮ Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA ⋮ Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} ⋮ On the modal logic of subset and superset: tense logic over Medvedev frames ⋮ Elementary canonical formulae: extending Sahlqvist's theorem ⋮ Many-sorted hybrid modal languages ⋮ The bounded proof property via step algebras and step frames ⋮ Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations ⋮ Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA ⋮ Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$

This page was built for publication: Sahlqvist Formulas in Hybrid Polyadic Modal Logics