Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA

DOI10.1016/j.entcs.2009.02.035zbMath1347.03018OpenAlexW2066519065MaRDI QIDQ4982120

Willem Conradie

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.035

zbMATH Keywords

completenesshybrid logicSahlqvist formulasfirst-order correspondenceSQEMA-algorithm

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44)

Related Items (1)

Algorithmic correspondence and canonicity for distributive modal logic

Uses Software

• SQEMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tools and techniques in modal logic
• Modal logic with names
• Elementary canonical formulae: extending Sahlqvist's theorem
• Sahlqvist Formulas in Hybrid Polyadic Modal Logics
• Interpolation for extended modal languages
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• On the strength and scope of DLS
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Hybrid logics with Sahlqvist axioms
• Relational and Kleene-Algebraic Methods in Computer Science

This page was built for publication: Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA