Characterizations of two basic hybrid logics
From MaRDI portal
modal logicbisimulationnominalsfinite modelsbisimulation-closed classeshybrid logic characterization theoremvan Benthem-Rosen theorem
Modal logic (including the logic of norms) (03B45) Games involving topology, set theory, or logic (91A44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Model theory of denumerable and separable structures (03C15) Mathematical logic and foundations (03-XX) Computer science (68-XX)
Cites work
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 4041866 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- A BISIMULATION CHARACTERIZATION THEOREM FOR HYBRID LOGIC WITH THE CURRENT-STATE BINDER
- A modular bisimulation characterisation for fragments of hybrid logic
- A van Benthem/Rosen theorem for coalgebraic predicate logic
- Bisimulation invariance and finite models
- Characterization, definability and separation via saturated models
- Coalgebraic Hybrid Logic
- Comonadic semantics for hybrid logic
- Handbook of modal logic
- Hybrid logics: Characterization, interpolation and complexity
- Modal characterisation theorems over special classes of frames
- Modal logic over finite structures
- Named models in coalgebraic hybrid logic
This page was built for publication: Characterizations of two basic hybrid logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909860)