Hierarchies of modal and temporal logics with reference pointers

DOI10.1007/BF00215625zbMATH Open0851.03003OpenAlexW2170352409MaRDI QIDQ1919987FDOQ1919987

Authors: Valentin Goranko 

Publication date: 4 November 1996

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00215625

Recommendations

• scientific article; zbMATH DE number 1536552
• A hierarchy of modal logics with relative accessibility relations
• Temporal Logics with Reference Pointers and Computation Tree Logics
• The computational complexity of hybrid temporal logics
• Arity hierarchy for temporal logics

zbMATH Keywords

completenessmodal logicaxiomatizationexpressivenesstemporal logichierarchies of extensionsreference pointerssemantic references

Mathematics Subject Classification ID

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

Cited In (27)

• Naming worlds in modal and temporal logic
• Model checking hybrid logics (with an application to semistructured data)
• The complexity of satisfiability for fragments of hybrid logic. I.
• Temporal reference in linear tense logic
• Model checking memoryful linear-time logics over one-counter automata
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• A simple logic of concepts
• On Freeze LTL with Ordered Attributes
• Complexity and Succinctness Issues for Linear-Time Hybrid Logics
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• From \textit{counterfactual} conditionals to \textit{temporal} conditionals
• Repairing the interpolation theorem in quantified modal logic
• Title not available (Why is that?)
• The Fitch-Church paradox and first order modal logic
• Complexity of hybrid logics over transitive frames
• Completeness in hybrid type theory
• Temporal logic with accessibility temporal relations generated by time states themselves
• The complexity of hybrid logics over equivalence relations
• Complexity and succinctness issues for linear-time hybrid logics
• Model checking for hybrid logic
• Pure extensions, proof rules, and hybrid axiomatics
• LTL over integer periodicity constraints
• Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge
• Formulas expressing totally nonstable truth values of formulas
• Temporal Logics with Reference Pointers and Computation Tree Logics
• Testing XML constraint satisfiability
• Logics for actor networks: a two-stage constrained-hybridisation approach

This page was built for publication: Hierarchies of modal and temporal logics with reference pointers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919987)