AbstractWe consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the hybrid proof rule BG is topologically not sound. Indeed, among all topological spaces the BG rule characterizes those that can be represented as a Kripke frame (i.e., the Alexandroff spaces). We also demonstrate that, when the BG rule is dropped and only the Name rule is kept, one can prove a general topological completeness result for hybrid logics axiomatized by pure formulas. Finally, we indicate some limitations of the topological expressive power of pure formulas. All results generalize to neighborhood frames
Hybridisation is a systematic process along which the characteristic features of hybrid logic, both...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
The book stands at the intersection of two topics: the decidability and computational complexity of ...
AbstractWe consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological s...
In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics....
AbstractThis paper discusses two experiments in theorem proving for hybrid logic under the topologic...
AbstractThe main aim of this paper is to propose a robust way to combine two monotone hybrid logics....
This paper discusses two experiments in theorem proving for hybrid logic under the topological inter...
This paper is about non-labelled proof-systems for hybrid logic, that is, proofsystems where arbitra...
This paper discusses two experiments in theorem proving for hybrid logic under the topological inter...
International audienceWe study hybrid logics in topological semantics. We prove that hybrid logics o...
We presente spatial logics and spatio-temporal logics in the paradigm of hybrid modal logics. These ...
AbstractWe present a bimodal logic suitable for formalizing reasoning about points and sets, and als...
AbstractThe aim of this paper is to propose a two-dimensional hybrid logic in order to formalize inf...
AbstractWe study hybrid logics with nominals and ‘actuality’ operators @i.We recall the method of te...
Hybridisation is a systematic process along which the characteristic features of hybrid logic, both...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
The book stands at the intersection of two topics: the decidability and computational complexity of ...
AbstractWe consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological s...
In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics....
AbstractThis paper discusses two experiments in theorem proving for hybrid logic under the topologic...
AbstractThe main aim of this paper is to propose a robust way to combine two monotone hybrid logics....
This paper discusses two experiments in theorem proving for hybrid logic under the topological inter...
This paper is about non-labelled proof-systems for hybrid logic, that is, proofsystems where arbitra...
This paper discusses two experiments in theorem proving for hybrid logic under the topological inter...
International audienceWe study hybrid logics in topological semantics. We prove that hybrid logics o...
We presente spatial logics and spatio-temporal logics in the paradigm of hybrid modal logics. These ...
AbstractWe present a bimodal logic suitable for formalizing reasoning about points and sets, and als...
AbstractThe aim of this paper is to propose a two-dimensional hybrid logic in order to formalize inf...
AbstractWe study hybrid logics with nominals and ‘actuality’ operators @i.We recall the method of te...
Hybridisation is a systematic process along which the characteristic features of hybrid logic, both...
Ph.D. (Mathematics)Algebraic methods have been largely ignored within the eld of hybrid logics. A ma...
The book stands at the intersection of two topics: the decidability and computational complexity of ...