Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA | Zendy

Willem Conradie | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA

Author(s) -

Willem Conradie

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.02.035

Subject(s) - completeness (order theory) , extension (predicate logic) , axiom , gödel's completeness theorem , mathematics , conservative extension , hybrid system , frame (networking) , algebra over a field , discrete mathematics , algorithm , calculus (dental) , theoretical computer science , computer science , programming language , pure mathematics , medicine , mathematical analysis , telecommunications , geometry , dentistry , machine learning

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research