Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA

Authors:
Willem Conradie
Affiliations:
Department of Mathematics, University of Johannesburg, South Africa
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 2
Cited 2

Modal logic

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

Journal of Logic and Computation

Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions

Fundamenta Informaticae
Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a new algorithm, based upon the SQEMA-algorithm, for computing first-order frame correspondents of hybrid formulas. It is shown that the success of this algorithm on an input formula guarantees its sd-persistence and hence the completeness of the logic obtained by adding that formula as axiom to the basic hybrid system. These results are employed to obtain a hybridized extension of Sahlqvist's theorem.