5 research outputs found

    Algebraic methods for hybrid logics

    Get PDF
    Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A main theme of this thesis is to illustrate the usefulness of algebraic methods in this eld. It is a well-known fact that certain properties of a logic correspond to properties of particular classes of algebras, and that we therefore can use these classes of algebras to answer questions about the logic. The rst aim of this thesis is to identify a class of algebras corresponding to hybrid logics. In particular, we introduce hybrid algebras as algebraic semantics for the better known hybrid languages in the literature. The second aim of this thesis is to use hybrid algebras to solve logical problems in the eld of hybrid logic. Specically, we will focus on proving general completeness results for some well-known hybrid logics with respect to hybrid algebras. Next, we study Sahlqvist theory for hybrid logics. We introduce syntactically de ned classes of hybrid formulas that have rst-order frame correspondents, which are preserved under taking Dedekind MacNeille completions of atomic hybrid algebras, and which are preserved under canonical extensions of permeated hybrid algebras. Finally, we investigate the nite model property (FMP) for several hybrid logics. In particular, we give analogues of Bull's theorem for the hybrid logics under consideration in this thesis. We also show that if certain syntactically de ned classes of hybrid formulas are added to the normal modal logic S4 as axioms, we obtain hybrid logics with the nite model property

    Logic and Games of Norms: a Computational Perspective

    Get PDF

    Algebraization of Hybrid Logic with Binders

    No full text
    Abstract. This paper introduces an algebraic semantics for hybrid logic with binders H(↓, @). It is known that this formalism is a modal counterpart of the bounded fragment of the first-order logic, studied by Feferman in the 1960’s. The algebraization process leads to an interesting class of boolean algebras with operators, called substitution-satisfaction algebras. We provide a representation theorem for these algebras and thus provide an algebraic proof of completeness of hybrid logic
    corecore