Hybrid languages
From MaRDI portal
Publication:1909610
DOI10.1007/BF01049415zbMath0847.03009OpenAlexW4256000740MaRDI QIDQ1909610
Jerry Seligman, Patrick Blackburn
Publication date: 17 March 1996
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01049415
Related Items (42)
Towards World Identification in Description Logics ⋮ The Range of Modal Logic ⋮ The decision problem of modal product logics with a diagonal, and faulty counter machines ⋮ Expressive power of ``now and ``then operators ⋮ Henkin and Hybrid Logic ⋮ The Fitch-Church paradox and first order modal logic ⋮ On the subtle nature of a simple logic of the hide and seek game ⋮ A modal logic for supervised learning ⋮ Arthur Prior and hybrid logic ⋮ Pure extensions, proof rules, and hybrid axiomatics ⋮ On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic ⋮ Axiomatisation and decidability of multi-dimensional Duration Calculus ⋮ Introducing \(H\), an institution-based formal specification and verification language ⋮ A simple logic of the hide and seek game ⋮ Logics for actor networks: a two-stage constrained-hybridisation approach ⋮ A simple logic of concepts ⋮ Expressive Power and Decidability for Memory Logics ⋮ Complexity of hybrid logics over transitive frames ⋮ Repairing the interpolation theorem in quantified modal logic ⋮ Unnamed Item ⋮ Second-order propositional modal logic and monadic alternation hierarchies ⋮ Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications ⋮ A tableau decision procedure for \(\mathcal{SHOIQ}\) ⋮ Understanding the Brandenburger-Keisler paradox ⋮ A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Arthur Prior and `now' ⋮ Hybrid logics: characterization, interpolation and complexity ⋮ Encoding hybridized institutions into first-order logic ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ Temporal languages for epistemic programs ⋮ Temporal Logics with Reference Pointers and Computation Tree Logics ⋮ A prover dealing with nominals, binders, transitivity and relation hierarchies ⋮ THE EXPRESSIVE POWER OF MEMORY LOGICS ⋮ Intuitionistic hybrid logic: introduction and survey ⋮ A first step towardsmodeling semistructured data in hybrid multimodal logic ⋮ The complexity of hybrid logics over equivalence relations ⋮ Hybrid Logics and Ontology Languages ⋮ Undecidability of Multi-modal Hybrid Logics ⋮ Testing XML constraint satisfiability ⋮ A Hybridization of Irreflexive Modal Logics ⋮ A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities
Cites Work
- Nominal tense logic
- An essay in combinatory dynamic logic
- Towards a general theory of action and time
- PDL with data constants
- Modal logic with names
- Determiners and logic
- Using the Universal Modality: Gains and Questions
- The modal logic of inequality
- An approach to tense logic1
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hybrid languages
