On the public citation graph
Temporal logic with reference pointers
0 signed · 48 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.
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.
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-8384-7openalex-snapshot
Aspects of Philosophical 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-009-8384-7_4openalex-snapshot
Expressive Functional Completeness in Tense Logic (Preliminary report)
inferredcites →https://doi.org/10.1007/978-94-017-0462-5openalex-snapshot
Handbook of Philosophical Logic
inferredcites →https://doi.org/10.1016/0890-5401(91)90026-xopenalex-snapshot
An essay in combinatory dynamic logic
inferredcites →https://doi.org/10.1093/acprof:oso/9780198243113.001.0001openalex-snapshot
Past, Present and Future
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.1305/ndjfl/1093870149openalex-snapshot
Axioms for tense logic. I. ``Since'' and ``until''.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-71671-3_2openalex-snapshot
BNClassifier: Classifying Boolean Models by Dynamic Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-78750-8_11openalex-snapshot
Symbolic Model Checking of Hybrid CTL on Coloured Kripke Structures
inferred← citeshttps://doi.org/10.1007/978-3-032-04590-4_17openalex-snapshot
On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_24openalex-snapshot
Dynamic Logic with Binders and Its Application to the Development of Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_3openalex-snapshot
Counter Systems for Data Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_9openalex-snapshot
Witness Runs for Counter Machines
inferred← citeshttps://doi.org/10.1007/978-94-007-0002-4_1openalex-snapshot
Introduction to Hybrid Logic
inferred← citeshttps://doi.org/10.1007/s00165-021-00550-7openalex-snapshot
Hybrid dynamic logic institutions for event/data-based systems
inferred← citeshttps://doi.org/10.1007/s10270-012-0301-9openalex-snapshot
Evolution styles: foundations and models for software architecture evolution
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-9093-xopenalex-snapshot
Branching-Time Logics Repeatedly Referring to States
inferred← citeshttps://doi.org/10.1007/s10849-023-09400-6openalex-snapshot
From Counterfactual Conditionals to Temporal Conditionals
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.11.007openalex-snapshot
Model checking for hybrid branching-time logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.004openalex-snapshot
A logic for the stepwise development of reactive systems
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03012-xopenalex-snapshot
Chapter 12 Temporal Representation and Reasoning
inferred← citeshttps://doi.org/10.1080/11663081.1999.10510982openalex-snapshot
Inequality without irreflexivity
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/bioinformatics/btad158openalex-snapshot
Boolean network sketches: a unifying framework for logical model inference
inferred← citeshttps://doi.org/10.1093/jigpal/6.1.73openalex-snapshot
Products of modal logics, part 1
inferred← citeshttps://doi.org/10.1109/time.2016.11openalex-snapshot
Model Checking for the Full Hybrid Computation Tree Logic
inferred← citeshttps://doi.org/10.12775/llp.2016.004openalex-snapshot
Simple cut elimination proof for hybrid logic
inferred← citeshttps://doi.org/10.22028/d291-26295openalex-snapshot
Incremental decision procedures for modal logics with nominals and eventualities
inferred← citeshttps://doi.org/10.29007/dzc2openalex-snapshot
Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic
inferred← citeshttps://doi.org/10.48550/arxiv.0708.1723openalex-snapshot
Hybrid Branching-Time Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1508.03630openalex-snapshot
Undecidability of a Very Simple Modal Logic with Binding
inferred← citeshttps://doi.org/10.70675/3a23b5f9z537cz4dd0z9fd8z42fe13aeb3abopenalex-snapshot
Reasoning Tasks for Hybrid Logics
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.