Algebraization of Hybrid Logic with Binders
نویسنده
چکیده
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.
منابع مشابه
An analogue of Bull's theorem for Hybrid Logic
Hybrid logic extends modal logic with a special sort of variables, called nominals, which are evaluated to singletons in Kripke models by valuations, thus acting as names for states in models, see e.g. [1]. Various syntactic mechanisms for exploiting and enhancing the expressive power gained through the addition of nominals can be included, most characteristically the satisfaction operator, @iφ...
متن کاملAbstract: Algebraic semantics for some hybrid logics, and a new Sahlqvist Theorem
Algebraic semantics for some hybrid logics, and a new Sahlqvist Theorem Willem Conradie and Claudette Robinson Hybrid logics extend basic modal logic with special variables, called nominals, which are evaluated to singletons in Kripke models, thus acting as names for states in models. These logics typically also include other operators which utilize the nominals and in so doing take us well bey...
متن کاملHybrid Languages
Hybrid languages have both modal and first-order characteristics: a Kripke semantics, and explicit variable binding apparatus. This paper motivates the development of hybrid languages, sketches their history, and examines the expressive power of three hybrid binders. We show that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full firs...
متن کاملHybrid Ockhamist Temporal Logic
We introduce hybrid Ockhamist temporal logic, which combines the mechanisms of hybrid logic with Ockhamist semantics by employing nominals, satisfaction operators, binders, and quantifiers over branches. We provide a complete (with respect to bundled trees semantics) axiomatic system for the basic hybrid Ockhamist temporal logic (HOT) and for some of its extensions, including the full hybrid Oc...
متن کاملModel checking hybrid logics (with an application to semistructured data)
We investigate the complexity of the model checking problem for hybrid logics. We provide model checking algorithms for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders. We complement and motivate our complexity results with an application of model checking in hybrid logic to the problems of query and constraint evaluation for semistructured data....
متن کامل