On the public citation graph

Gentzen-Systems for propositional temporal logics

https://doi.org/10.1007/bfb0026305
0 signed · 60 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-09526-8_48openalex-snapshot
On axiomatization of deterministic propositional dynamic logic
inferredcites →https://doi.org/10.1007/3-540-15648-8_1openalex-snapshot
Nonclausal temporal deduction
inferredcites →https://doi.org/10.1007/3-540-15670-4_6openalex-snapshot
Executing temporal logic programs
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_7openalex-snapshot
A Decision Method for Linear Temporal Logic
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-642-71549-5openalex-snapshot
Temporal Logic of Programs
inferredcites →https://doi.org/10.1007/bf00268322openalex-snapshot
Sequential method in propositional dynamic logic
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1016/0022-0000(82)90003-4openalex-snapshot
Process logic: Expressiveness, decidability, completeness
inferredcites →https://doi.org/10.1016/0022-0000(82)90018-6openalex-snapshot
Deterministic propositional dynamic logic: Finite models, complexity, and completeness
inferredcites →https://doi.org/10.1016/0022-0000(85)90001-7openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1016/0304-3975(85)90225-7openalex-snapshot
Process logic with regular formulas
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(77)90443-0openalex-snapshot
Application of model theoretic games to discrete linear orders and finite automata
inferredcites →https://doi.org/10.1016/s0019-9958(79)90629-6openalex-snapshot
Star-free regular sets of ω-sequences
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1126/science.52.1337.155.aopenalex-snapshot
Mathematische Zeitschrift

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36078-6_6openalex-snapshot
Searching for Invariants Using Temporal Resolution
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_19openalex-snapshot
An Automata-Theoretic Completeness Proof for Interval Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_17openalex-snapshot
Compositional Reasoning using Interval Temporal Logic and Tempura
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_81openalex-snapshot
Extending temporal logic by explicit concurrency
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_28openalex-snapshot
A New One-Pass Tableau Calculus for PLTL
inferred← citeshttps://doi.org/10.1007/978-1-4615-5123-2_7openalex-snapshot
Interval Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-62864-6_18openalex-snapshot
The Proof Theory of Common Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_22openalex-snapshot
A Hierarchical Completeness Proof for Propositional Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_36openalex-snapshot
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
inferred← citeshttps://doi.org/10.1007/978-3-642-02734-5_5openalex-snapshot
Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-79646-3_9openalex-snapshot
Unterstützung des korrektheitszentrierten Entwurfs von Informationssystemen
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_6openalex-snapshot
Tableau Methods for Modal and Temporal Logics
inferred← citeshttps://doi.org/10.1007/s00236-007-0062-zopenalex-snapshot
A decision procedure for propositional projection temporal logic with infinite models
inferred← citeshttps://doi.org/10.1007/s10472-013-9356-8openalex-snapshot
Compositional reasoning using intervals and time reversal
inferred← citeshttps://doi.org/10.1007/s10817-020-09544-1openalex-snapshot
Loop-Type Sequent Calculi for Temporal Logic
inferred← citeshttps://doi.org/10.1007/s10986-025-09671-5openalex-snapshot
Global condition check strategy for a cyclic sequent calculus of temporal logic
inferred← citeshttps://doi.org/10.1007/s11225-022-10010-9openalex-snapshot
Loop-Check Specification for a Sequent Calculus of Temporal Logic
inferred← citeshttps://doi.org/10.1007/s11225-023-10052-7openalex-snapshot
Refutation-Aware Gentzen-Style Calculi for Propositional Until-Free Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2011.12.002openalex-snapshot
Bounded linear-time temporal logic: A proof-theoretic investigation
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.075openalex-snapshot
Systematic Semantic Tableaux for PLTL
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.02.004openalex-snapshot
Cut-free sequent systems for temporal logic
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.05.001openalex-snapshot
Dual Systems of Tableaux and Sequents for PLTL
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.026openalex-snapshot
A complete proof system for propositional projection temporal logic
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80014-0openalex-snapshot
11 Temporal logic
inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot
Time in Qualitative Simulation
inferred← citeshttps://doi.org/10.1093/jigpal/jzq023openalex-snapshot
Phase semantics for linear-time formalism
inferred← citeshttps://doi.org/10.1093/jigpal/jzz022openalex-snapshot
A proof-search system for the logic of likelihood
inferred← citeshttps://doi.org/10.1093/logcom/exx006openalex-snapshot
Relating first-order monadic omega-logic, propositional linear-time temporal logic, propositional generalized definitional reflection logic and propositional infinitary logic
inferred← citeshttps://doi.org/10.1109/iceccs.1995.479336openalex-snapshot
Compositional reasoning about projected and infinite time
inferred← citeshttps://doi.org/10.1109/lics.1995.523242openalex-snapshot
Complete proof systems for first order interval temporal logic
inferred← citeshttps://doi.org/10.1109/lics.2000.855773openalex-snapshot
A complete axiomatization of interval temporal logic with infinite time
inferred← citeshttps://doi.org/10.1109/tase.2008.22openalex-snapshot
A Complete Axiomatization of Propositional Projection Temporal Logic
inferred← citeshttps://doi.org/10.1109/time.2011.25openalex-snapshot
Compositional Reasoning Using Intervals and Time Reversal
inferred← citeshttps://doi.org/10.1145/2528931openalex-snapshot
Logical foundations for more expressive declarative temporal logic programming languages
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.21203/rs.3.rs-3845308/v1openalex-snapshot
Decision Procedure for Temporal Logic Using Cyclic Sequent Calculi
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:10)2012openalex-snapshot
A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time
inferred← citeshttps://doi.org/10.3166/jancl.14.105-148openalex-snapshot
PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic
inferred← citeshttps://doi.org/10.3166/jancl.14.55-104openalex-snapshot
A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
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.5772/5319openalex-snapshot
A Linear Logic Based Approach to Timed Petri Nets
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.