On the public citation graph

Natural Deduction Calculus for Linear-Time Temporal Logic

https://doi.org/10.1007/11853886_7
0 signed · 30 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/3-540-48959-2_21openalex-snapshot
Natural Deduction for Intuitionistic Non-commutative Linear Logic
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-540-73228-0_19openalex-snapshot
Extensional Rewriting with Sums
inferredcites →https://doi.org/10.1007/978-94-009-9056-2_17openalex-snapshot
Logic and Computers
inferredcites →https://doi.org/10.1016/b978-044450813-3/50019-9openalex-snapshot
Logical Frameworks
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7039-9openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.1016/s0898-1221(01)90047-1openalex-snapshot
Reasoning about rational agents
inferredcites →https://doi.org/10.1145/371282.371311openalex-snapshot
Clausal temporal resolution
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.2307/2184212openalex-snapshot
Polish Logic 1920-1939.
inferredcites →https://doi.org/10.2307/2266969openalex-snapshot
On natural deduction
inferredcites →https://doi.org/10.7551/mitpress/5804.001.0001openalex-snapshot
Reasoning about Rational Agents

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119991472.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-3-032-28187-6_12openalex-snapshot
tptl-dist: A Calculus for Verifying Real-Time Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_8openalex-snapshot
Labelled Systems in Modal Logics
inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_9openalex-snapshot
Logics of Linear Frames
inferred← citeshttps://doi.org/10.1017/s1755020317000156openalex-snapshot
AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX
inferred← citeshttps://doi.org/10.1093/logcom/exs002openalex-snapshot
Strong normalization in some temporal substructural logics
inferred← citeshttps://doi.org/10.1109/jva.2006.34openalex-snapshot
Natural Deduction Calculus for Computation Tree Logic
inferred← citeshttps://doi.org/10.1109/ssiri-c.2011.41openalex-snapshot
Handling Periodic Properties: Deductive Verification for Quantified Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/time.2007.41openalex-snapshot
Automated Natural Deduction for Propositional Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1109/time.2008.28openalex-snapshot
Labeled Natural Deduction Systems for a Family of Tense Logics
inferred← citeshttps://doi.org/10.12775/llp.2018.009openalex-snapshot
Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis
inferred← citeshttps://doi.org/10.1515/jisys-2011-0021openalex-snapshot
Natural Deduction System in Paraconsistent Setting: Proof Search for PCont
inferred← citeshttps://doi.org/10.18778/0138-0680.2025.09openalex-snapshot
Unified Sequent Calculi and Natural Deduction Systems for Until-free Linear-time Temporal Logics
inferred← citeshttps://doi.org/10.21146/2074-1472-2014-20-0-222-245openalex-snapshot
Natural deduction in a paracomplete setting
inferred← citeshttps://doi.org/10.21146/2074-1472-2017-23-1-83-104openalex-snapshot
A Precise Definition of an Inference (by the Example of Natural Deduction Systems for Logics $I_{\langle \alpha,\beta \rangle}$
inferred← citeshttps://doi.org/10.4204/eptcs.415.16openalex-snapshot
A Unified Gentzen-style Framework for Until-free LTL
inferred← citeshttps://doi.org/10.4467/20842589rm.12.002.0683openalex-snapshot
Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.0803.3187openalex-snapshot
Labeled Natural Deduction Systems for a Family of Tense 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.