Hybrid logics: characterization, interpolation and complexity

DOI10.2307/2695090zbMath0984.03018OpenAlexW2068458083MaRDI QIDQ2758042

Patrick Blackburn, Maarten Marx, Carlos Areces

Publication date: 30 April 2002

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2695090

zbMATH Keywords

complexity modal logic decidability bisimulation expressiveness interpolation property hybrid language

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items

Constructive interpolation in hybrid logic ⋮ Expressive power of ``now and ``then operators ⋮ An efficient approach to nominal equalities in hybrid logic tableaux ⋮ Henkin and Hybrid Logic ⋮ Ensuring Correctness of Model Transformations While Remaining Decidable ⋮ On the Hybrid Extension of CTL and CTL + ⋮ Axioms for classical, intuitionistic, and paraconsistent hybrid logic ⋮ Incorporating the Relation into the Language? ⋮ A logic of reachable patterns in linked data-structures ⋮ Arthur Prior and hybrid logic ⋮ Pure extensions, proof rules, and hybrid axiomatics ⋮ Separation logics and modalities: a survey ⋮ Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions ⋮ Expressive Power and Decidability for Memory Logics ⋮ Modal logics and local quantifiers: a zoo in the elementary hierarchy ⋮ Complexity of hybrid logics over transitive frames ⋮ Repairing the interpolation theorem in quantified modal logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complexity and Succinctness Issues for Linear-Time Hybrid Logics ⋮ The expressibility of fragments of hybrid graph logic on finite digraphs ⋮ Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics ⋮ Second-order propositional modal logic and monadic alternation hierarchies ⋮ A study on multi-dimensional products of graphs and hybrid logics ⋮ Polynomial hierarchy graph properties in hybrid logic ⋮ On the expressive power of hybrid branching-time logics ⋮ On the verification of architectural reconfigurations ⋮ A Completeness Result for Relation Algebra with Binders ⋮ On bisimulations for description logics ⋮ A Hilbert-style axiomatisation for equational hybrid logic ⋮ A BISIMULATION CHARACTERIZATION THEOREM FOR HYBRID LOGIC WITH THE CURRENT-STATE BINDER ⋮ THE BOUNDED FRAGMENT AND HYBRID LOGIC WITH POLYADIC MODALITIES ⋮ Indistinguishability, choices, and logics of agency ⋮ IF modal logic and classical negation ⋮ On the complexity of resource-bounded logics ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ Unnamed Item ⋮ Verification of dynamic bisimulation theorems in Coq ⋮ Model Checking Strategic Equilibria ⋮ A proof-theoretic study of the correspondence of hybrid logic and classical logic ⋮ Non-dual modal operators as a basis for 4-valued accessibility relations in hybrid logic ⋮ THE EXPRESSIVE POWER OF MEMORY LOGICS ⋮ Truth-values as labels: a general recipe for labelled deduction ⋮ Terminating Tableau Calculi for Hybrid Logics Extending K ⋮ Intuitionistic hybrid logic: introduction and survey ⋮ A first step towardsmodeling semistructured data in hybrid multimodal logic ⋮ Complexity and succinctness issues for linear-time hybrid logics ⋮ Hybrid logic meets IF modal logic ⋮ Branching-time logics repeatedly referring to states ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Formalizing a Seligman-style tableau system for hybrid logic (short paper) ⋮ Modal logic, truth, and the master modality. ⋮ Testing XML constraint satisfiability ⋮ Hybridizing a Logical Framework ⋮ Omitting types theorem in hybrid dynamic first-order logic with rigid symbols ⋮ Remarks on Gregory's ``actually operator ⋮ Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere

Cites Work