Hybrid logics: Characterization, interpolation and complexity
From MaRDI portal
In the paper a hybrid modal language \({\mathcal H}(\downarrow, \@)\), corresponding to the fragment of first-order logic which is invariant for generated submodels, is considered. The language enjoys the strong interpolation property. Complexity results for fragments of \({\mathcal H}(\downarrow, \@)\) are given and undecidability results for the whole language are sharpened.
Recommendations
Cites work
- A guide to completeness and complexity for modal logics of knowledge and belief
- A Modal Logic for Quantification and Substitution
- An essay in combinatory dynamic logic
- scientific article; zbMATH DE number 986406 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 3271460 (Why is no real title available?)
- Hybrid completeness
- Hybrid languages
- Hybrid languages and temporal logic
- Modal logic with names
- Multi-dimensional modal logic
- The computational complexity of hybrid temporal logics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
Cited in
(82)- A proof-theoretic study of the correspondence of hybrid logic and classical logic
- Complexity and succinctness issues for linear-time hybrid logics
- Hybrid logic meets IF modal logic
- Branching-time logics repeatedly referring to states
- Repairing the interpolation theorem in quantified modal logic
- Remarks on Gregory's ``actually operator
- On the verification of architectural reconfigurations
- Modal logic, truth, and the master modality.
- Hybrid languages
- On the expressive power of hybrid branching-time logics
- Indistinguishability, choices, and logics of agency
- IF modal logic and classical negation
- Verification of dynamic bisimulation theorems in Coq
- Non-dual modal operators as a basis for 4-valued accessibility relations in hybrid logic
- Formalizing a Seligman-style tableau system for hybrid logic (short paper)
- Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
- Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics
- A Hilbert-style axiomatisation for equational hybrid logic
- Hybrid fragments of Halpern-Shoham logic and their expressive power
- The expressibility of fragments of hybrid graph logic on finite digraphs
- Polynomial hierarchy graph properties in hybrid logic
- Model checking hybrid logics (with an application to semistructured data)
- A logic of reachable patterns in linked data-structures
- Higher-order syntax and saturation algorithms for hybrid logic
- Testing XML constraint satisfiability
- A hybridization of irreflexive modal logics
- Hybridizing a logical framework
- An efficient approach to nominal equalities in hybrid logic tableaux
- Expressive power of ``now and ``then operators
- The expressive power of memory logics
- Constructive interpolation in hybrid logic
- Ensuring correctness of model transformations while remaining decidable
- On the Hybrid Extension of CTL and CTL +
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
- Interpolation for extended modal languages
- Henkin and hybrid logic
- scientific article; zbMATH DE number 6533399 (Why is no real title available?)
- Expressive Power and Decidability for Memory Logics
- Complexity and Succinctness Issues for Linear-Time Hybrid Logics
- A BISIMULATION CHARACTERIZATION THEOREM FOR HYBRID LOGIC WITH THE CURRENT-STATE BINDER
- The bounded fragment and hybrid logic with polyadic modalities
- Model Checking Strategic Equilibria
- Truth-values as labels: a general recipe for labelled deduction
- A first step towards modeling semistructured data in hybrid multimodal logic
- Separation logics and modalities: a survey
- Second-order propositional modal logic and monadic alternation hierarchies
- A completeness result for relation algebra with binders
- Terminating Tableau Calculi for Hybrid Logics Extending K
- A temporal module for logical frameworks
- scientific article; zbMATH DE number 7453151 (Why is no real title available?)
- Incorporating the relation into the language? A survey of approaches in relating logic
- scientific article; zbMATH DE number 7577569 (Why is no real title available?)
- Interaction and the Marcan formula
- scientific article; zbMATH DE number 7407777 (Why is no real title available?)
- A complete axiomatisation for quantifier-free separation logic
- On bisimulations for description logics
- Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
- A Hybrid Intuitionistic Logic: Semantics and Decidability
- Robinson consistency in many-sorted hybrid first-order logics
- On the complexity of resource-bounded logics
- Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
- Modal logics and local quantifiers: a zoo in the elementary hierarchy
- Complexity of hybrid logics over transitive frames
- A study on multi-dimensional products of graphs and hybrid logics
- An abstract look at the fixed-point theorem for provability logic
- Time and Indexicality in Buridan’s Concept of Logical Consequence
- A van Benthem theorem for atomic and molecular logics
- Interpretation of hybrid counterfactual logic into hybrid tense logic: and comparison of their expressive power on temporal sphere models.
- A modular bisimulation characterisation for fragments of hybrid logic
- Hybrid-dynamic Ehrenfeucht-Fraïssé games
- Characterizations of two basic hybrid logics
- A monadic formalization of ML5
- Prior's ideal language
- Synthetic completeness for a terminating Seligman-style tableau system
- Hybrid logic of the hide and seek game
- Terminating hybrid tableaus for ordered models
- A Lindström theorem for the hybrid logic \(\mathcal{H}(\exists)\)
- Intuitionistic hybrid logic: introduction and survey
- Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere
- Axioms for classical, intuitionistic, and paraconsistent hybrid logic
- Arthur Prior and hybrid logic
- Pure extensions, proof rules, and hybrid axiomatics
This page was built for publication: Hybrid logics: Characterization, interpolation and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2758042)
