On the public citation graph

Hierarchies of modal and temporal logics with reference pointers

https://doi.org/10.1007/bf00215625
0 signed · 95 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-009-6259-0_2openalex-snapshot
Basic Tense Logic
inferredcites →https://doi.org/10.1007/978-94-009-8384-7_3openalex-snapshot
An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames
inferredcites →https://doi.org/10.1007/978-94-010-9868-7openalex-snapshot
The Logic of Time
inferredcites →https://doi.org/10.1007/bf01054038openalex-snapshot
Modal logic with names
inferredcites →https://doi.org/10.1007/bfb0028835openalex-snapshot
Quantifiers in combinatory PDL: Completeness, definability, incompleteness
inferredcites →https://doi.org/10.1016/0020-1383(89)90174-5openalex-snapshot
Locked posterior fracture-dislocation of the shoulder
inferredcites →https://doi.org/10.1016/0890-5401(91)90026-xopenalex-snapshot
An essay in combinatory dynamic logic
inferredcites →https://doi.org/10.1093/logcom/1.2.229openalex-snapshot
An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
inferredcites →https://doi.org/10.1111/j.1755-2567.1970.tb00428.xopenalex-snapshot
An approach to tense logic1
inferredcites →https://doi.org/10.1111/j.1755-2567.1971.tb00071.xopenalex-snapshot
To the memory of Arthur Prior Formal properties of ‘now’
inferredcites →https://doi.org/10.1163/9789004252882_004openalex-snapshot
Formal Properties of ‘Now’
inferredcites →https://doi.org/10.1305/ndjfl/1093634564openalex-snapshot
Nominal tense logic.
inferredcites →https://doi.org/10.1305/ndjfl/1093870149openalex-snapshot
Axioms for tense logic. I. ``Since'' and ``until''.
inferredcites →https://doi.org/10.2307/2275109openalex-snapshot
Derivation rules as anti-axioms in modal logic
inferredcites →https://doi.org/10.2307/2275293openalex-snapshot
The modal logic of inequality

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11538363_24openalex-snapshot
On the Complexity of Hybrid Logics with Binders
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_22openalex-snapshot
A Road-Map on Complexity for Hybrid Logics
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_24openalex-snapshot
Tableau Calculi for Hybrid Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_13openalex-snapshot
A Decidable Temporal Logic of Repeating Values
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_34openalex-snapshot
Model Checking Freeze LTL over One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_6openalex-snapshot
Complexity and Succinctness Issues for Linear-Time Hybrid Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_50openalex-snapshot
The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_13openalex-snapshot
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable
inferred← citeshttps://doi.org/10.1007/978-3-642-20920-8_27openalex-snapshot
How Much Expressive Power Is Needed for Natural Language Temporal Indexicality?
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_16openalex-snapshot
On Freeze LTL with Ordered Attributes
inferred← citeshttps://doi.org/10.1007/978-94-007-0002-4_1openalex-snapshot
Introduction to Hybrid Logic
inferred← citeshttps://doi.org/10.1007/978-94-007-6600-6_1openalex-snapshot
Hybrid Logic
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_4openalex-snapshot
Discipline as Logic: Treating Labels as First Class Citizens
inferred← citeshttps://doi.org/10.1007/bf01049415openalex-snapshot
Hybrid languages
inferred← citeshttps://doi.org/10.1007/s10670-015-9730-5openalex-snapshot
The Fitch-Church Paradox and First Order Modal Logic
inferred← citeshttps://doi.org/10.1007/s10849-009-9088-7openalex-snapshot
Model Checking for Hybrid Logic
inferred← citeshttps://doi.org/10.1007/s10849-009-9089-6openalex-snapshot
The Complexity of Hybrid Logics over Equivalence Relations
inferred← citeshttps://doi.org/10.1007/s10849-023-09400-6openalex-snapshot
From Counterfactual Conditionals to Temporal Conditionals
inferred← citeshttps://doi.org/10.1007/s10992-009-9122-xopenalex-snapshot
Temporal Reference in Linear Tense Logic
inferred← citeshttps://doi.org/10.1007/s10992-012-9260-4openalex-snapshot
Completeness in Hybrid Type Theory
inferred← citeshttps://doi.org/10.1007/s10992-022-09685-1openalex-snapshot
A Simple Logic of Concepts
inferred← citeshttps://doi.org/10.1007/s11225-006-9009-6openalex-snapshot
Pure Extensions, Proof Rules, and Hybrid Axiomatics
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.025openalex-snapshot
Testing XML constraint satisfiability
inferred← citeshttps://doi.org/10.1016/j.ic.2006.08.003openalex-snapshot
On the freeze quantifier in Constraint LTL: Decidability and complexity
inferred← citeshttps://doi.org/10.1016/j.jal.2005.06.006openalex-snapshot
Methods for modalities 3
inferred← citeshttps://doi.org/10.1016/j.jal.2005.06.010openalex-snapshot
Model checking hybrid logics (with an application to semistructured data)
inferred← citeshttps://doi.org/10.1016/j.jal.2010.08.001openalex-snapshot
The complexity of satisfiability for fragments of hybrid logic—Part I
inferred← citeshttps://doi.org/10.1016/j.jal.2010.08.004openalex-snapshot
Complexity of hybrid logics over transitive frames
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.05.001openalex-snapshot
Logics for Actor Networks: A two-stage constrained-hybridisation approach
inferred← citeshttps://doi.org/10.1016/j.procs.2023.10.042openalex-snapshot
Algorithms for recognizing formulas with none-stable truth values in branching time logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.019openalex-snapshot
LTL over integer periodicity constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.009openalex-snapshot
Complexity and succinctness issues for linear-time hybrid logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.02.021openalex-snapshot
Model checking memoryful linear-time logics over one-counter automata
inferred← citeshttps://doi.org/10.1016/s0168-0072(03)00059-9openalex-snapshot
Repairing the interpolation theorem in quantified modal logic
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80017-6openalex-snapshot
14 Hybrid logics
inferred← citeshttps://doi.org/10.1017/9781009170093openalex-snapshot
Temporal Logics
inferred← citeshttps://doi.org/10.1017/cbo9781107050884openalex-snapshot
Modal Logic
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.002openalex-snapshot
Basic Concepts
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.003openalex-snapshot
Models
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.004openalex-snapshot
Frames
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.005openalex-snapshot
Completeness
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.006openalex-snapshot
Algebras and General Frames
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.007openalex-snapshot
Computability and Complexity
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.008openalex-snapshot
Extended Modal Logic
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.009openalex-snapshot
A Logical Toolkit
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.010openalex-snapshot
An Algebraic Toolkit
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.011openalex-snapshot
A Computational Toolkit
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.012openalex-snapshot
A Guide to the Literature
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.013openalex-snapshot
References
inferred← citeshttps://doi.org/10.1023/a:1005021313747openalex-snapshot
Axiomatizations with Context Rules of Inference in Modal Logic
inferred← citeshttps://doi.org/10.1023/a:1008398102653openalex-snapshot
An Extended Branching-Time Ockhamist Temporal Logic
inferred← citeshttps://doi.org/10.1023/a:1018988913388openalex-snapshot
Hybridizing concept languages
inferred← citeshttps://doi.org/10.1075/hop.11.mod1openalex-snapshot
Modal logic
inferred← citeshttps://doi.org/10.1075/hop.m2.mod1openalex-snapshot
Modal logic
inferred← citeshttps://doi.org/10.1080/11663081.2000.10510998openalex-snapshot
Temporal Logics with Reference Pointers and Computation Tree Logics
inferred← citeshttps://doi.org/10.1093/jigpal/6.1.73openalex-snapshot
Products of modal logics, part 1
inferred← citeshttps://doi.org/10.1093/jigpal/7.1.7openalex-snapshot
Temporal patterns and modal structure
inferred← citeshttps://doi.org/10.1093/jigpal/8.3.339openalex-snapshot
Representation, reasoning, and relational structures: a hybrid logic manifesto
inferred← citeshttps://doi.org/10.1093/jigpal/8.5.653openalex-snapshot
The computational complexity of hybrid temporal logics
inferred← citeshttps://doi.org/10.1093/logcom/11.5.657openalex-snapshot
Bringing them all Together
inferred← citeshttps://doi.org/10.1093/logcom/13.6.939openalex-snapshot
A Modal Perspective on Path Constraints
inferred← citeshttps://doi.org/10.1093/logcom/exac054openalex-snapshot
Decompositions of stratified institutions
inferred← citeshttps://doi.org/10.1093/logcom/exr013openalex-snapshot
Temporal Logics of Repeating Values
inferred← citeshttps://doi.org/10.1093/logcom/exw018openalex-snapshot
Implicit Kripke semantics and ultraproducts in stratified institutions
inferred← citeshttps://doi.org/10.1109/lics.2006.31openalex-snapshot
LTL with the Freeze Quantifier and Register Automata
inferred← citeshttps://doi.org/10.1109/time.2001.930716openalex-snapshot
Hybrid Ockhamist temporal logic
inferred← citeshttps://doi.org/10.1109/time.2003.1214891openalex-snapshot
Quantified propositional temporal logic with repeating states
inferred← citeshttps://doi.org/10.1109/time.2005.28openalex-snapshot
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity
inferred← citeshttps://doi.org/10.1109/time.2012.26openalex-snapshot
Undecidability and Temporal Logic: Some Landmarks from Turing to the Present
inferred← citeshttps://doi.org/10.1145/1507244.1507246openalex-snapshot
LTL with the freeze quantifier and register automata
inferred← citeshttps://doi.org/10.1145/3358499.3361221openalex-snapshot
Modal assertions for actor correctness
inferred← citeshttps://doi.org/10.1145/3763134openalex-snapshot
Modal Abstractions for Virtualizing Memory Addresses
inferred← citeshttps://doi.org/10.1145/3764860.3768337openalex-snapshot
Modal Verification Patterns for Systems Software
inferred← citeshttps://doi.org/10.17516/1997-1397-2022-15-1-114-124openalex-snapshot
Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge
inferred← citeshttps://doi.org/10.2307/2695090openalex-snapshot
Hybrid logics: characterization, interpolation and complexity
inferred← citeshttps://doi.org/10.33048/semi.2020.17.068openalex-snapshot
Temporal logic with overlap temporal relations generated by time states themselves
inferred← citeshttps://doi.org/10.48550/arxiv.1204.1196openalex-snapshot
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06355openalex-snapshot
On Freeze LTL with Ordered Attributes
inferred← citeshttps://doi.org/10.70675/25d20a7dzfea8z4000z8826z89056423c46dopenalex-snapshot
Reasoning on words and trees with data
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.