The following pages link to Hybrid languages (Q1909610):
Displaying 42 items.
- The decision problem of modal product logics with a diagonal, and faulty counter machines (Q295920) (← links)
- Expressive power of ``now'' and ``then'' operators (Q302173) (← links)
- The Fitch-Church paradox and first order modal logic (Q320315) (← links)
- Second-order propositional modal logic and monadic alternation hierarchies (Q466445) (← links)
- Arthur Prior and `now' (Q516423) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- Intuitionistic hybrid logic: introduction and survey (Q764256) (← links)
- Arthur Prior and hybrid logic (Q857663) (← links)
- Pure extensions, proof rules, and hybrid axiomatics (Q863181) (← links)
- Axiomatisation and decidability of multi-dimensional Duration Calculus (Q868026) (← links)
- Temporal languages for epistemic programs (Q1006494) (← links)
- The complexity of hybrid logics over equivalence relations (Q1047797) (← links)
- Repairing the interpolation theorem in quantified modal logic (Q1412840) (← links)
- On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic (Q1909605) (← links)
- On the subtle nature of a simple logic of the hide and seek game (Q2148792) (← links)
- A modal logic for supervised learning (Q2155207) (← links)
- Introducing \(H\), an institution-based formal specification and verification language (Q2183716) (← links)
- A prover dealing with nominals, binders, transitivity and relation hierarchies (Q2303237) (← links)
- A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities (Q2351166) (← links)
- Logics for actor networks: a two-stage constrained-hybridisation approach (Q2423775) (← links)
- A tableau decision procedure for \(\mathcal{SHOIQ}\) (Q2462647) (← links)
- Understanding the Brandenburger-Keisler paradox (Q2464651) (← links)
- Model checking hybrid logics (with an application to semistructured data) (Q2506828) (← links)
- Hybrid logics: characterization, interpolation and complexity (Q2758042) (← links)
- Hybrid Logics and Ontology Languages (Q2867944) (← links)
- Undecidability of Multi-modal Hybrid Logics (Q2867946) (← links)
- Testing XML constraint satisfiability (Q2867947) (← links)
- A Hybridization of Irreflexive Modal Logics (Q2867951) (← links)
- A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders (Q3010363) (← links)
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 (Q3011106) (← links)
- THE EXPRESSIVE POWER OF MEMORY LOGICS (Q3094189) (← links)
- Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications (Q3299589) (← links)
- Henkin and Hybrid Logic (Q3454819) (← links)
- Expressive Power and Decidability for Memory Logics (Q3511448) (← links)
- A first step towardsmodeling semistructured data in hybrid multimodal logic (Q3647216) (← links)
- Temporal Logics with Reference Pointers and Computation Tree Logics (Q4443400) (← links)
- The Range of Modal Logic (Q4531586) (← links)
- (Q5015266) (← links)
- Encoding hybridized institutions into first-order logic (Q5741578) (← links)
- Towards World Identification in Description Logics (Q5882770) (← links)
- A simple logic of the hide and seek game (Q6057624) (← links)
- A simple logic of concepts (Q6156201) (← links)
