Abstract. This paper introduces an algebraic semantics for hybrid logic with binders H(↓,@). It is known that this formalism is a modal counter-part 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
In this paper we provide the first (as far as we know) direct calculus deciding satisfiability of f...
t. A tableau calculus constituting a decision procedure for hybrid logic with the converse modali...
The modal operators usually associated with the notions of possibility and necessity are classically...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
Hybrid logic refers to a group of logics lying between modal and first-order logic in which one can ...
Hybrid languages are extended modal languages which can refer to (or even quantify over) worlds. The...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
Hybrid logic is a widely-studied extension of basic modal logic, which corresponds to the bounded fr...
Hybrid Logics are usually presented as an extension of modal logics where we can explicitly refer to...
It is shown how axiomatic specifications of Boolean Algebras with extra functions as well as proposi...
The book stands at the intersection of two topics: the decidability and computational complexity of ...
International audienceIn this paper we provide the first (as far as we know) direct calculus decidin...
In this paper we provide the first (as far as we know) direct calculus deciding satisfiability of f...
t. A tableau calculus constituting a decision procedure for hybrid logic with the converse modali...
In this paper we provide the first (as far as we know) direct calculus deciding satisfiability of f...
t. A tableau calculus constituting a decision procedure for hybrid logic with the converse modali...
The modal operators usually associated with the notions of possibility and necessity are classically...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
Hybrid logic refers to a group of logics lying between modal and first-order logic in which one can ...
Hybrid languages are extended modal languages which can refer to (or even quantify over) worlds. The...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
Hybrid logic is a widely-studied extension of basic modal logic, which corresponds to the bounded fr...
Hybrid Logics are usually presented as an extension of modal logics where we can explicitly refer to...
It is shown how axiomatic specifications of Boolean Algebras with extra functions as well as proposi...
The book stands at the intersection of two topics: the decidability and computational complexity of ...
International audienceIn this paper we provide the first (as far as we know) direct calculus decidin...
In this paper we provide the first (as far as we know) direct calculus deciding satisfiability of f...
t. A tableau calculus constituting a decision procedure for hybrid logic with the converse modali...
In this paper we provide the first (as far as we know) direct calculus deciding satisfiability of f...
t. A tableau calculus constituting a decision procedure for hybrid logic with the converse modali...
The modal operators usually associated with the notions of possibility and necessity are classically...