On the public citation graph

Investigation of finitary calculus for a discrete linear time logic by means of infinitary calculus

https://doi.org/10.1007/bfb0019366

0 signed · 33 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.1002/malq.19870330506openalex-snapshot

Sequential Calculus for a First Order Infinitary Temporal Logic

inferredcites →https://doi.org/10.1007/978-1-4613-0897-3openalex-snapshot

Mathematical Logic and Its Applications

inferredcites →https://doi.org/10.1007/bfb0029643openalex-snapshot

Investigation of finitary calculi for the temporal logics by means of infinitary calculi

inferredcites →https://doi.org/10.1016/0003-4843(78)90011-6openalex-snapshot

Bounds for proof-search and speed-up in the predicate calculus

inferredcites →https://doi.org/10.1016/0304-3975(86)90157-xopenalex-snapshot

Concerning the semantic consequence relation in first-order temporal logic

inferredcites →https://doi.org/10.1016/0304-3975(89)90138-2openalex-snapshot

The power of temporal proofs

inferredcites →https://doi.org/10.2307/2272747openalex-snapshot

Decidability of some intuitionistic predicate theories

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-55460-2_29openalex-snapshot

Logical foundation for logic programming based on first order linear 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-94-017-0487-8_26openalex-snapshot

Mathematical Logic in the Former Soviet Union: Brief History and Current Trends

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/bfb0023420openalex-snapshot

Design complete sequential calculus for continuous fixpoint temporal logic

inferred← citeshttps://doi.org/10.1007/bfb0023891openalex-snapshot

Complete sequential calculi for the first order symmetrical linear temporal logic with until and since

inferred← citeshttps://doi.org/10.1007/bfb0023895openalex-snapshot

A sequent calculus for a first order linear temporal logic with equality

inferred← citeshttps://doi.org/10.1007/s10958-005-0109-zopenalex-snapshot

Invertible infinitary calculus without loop rules for restricted FTL

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.apal.2012.04.006openalex-snapshot

Syntactic cut-elimination for a fragment of the modal mu-calculus

inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.075openalex-snapshot

Systematic Semantic Tableaux for PLTL

inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.038openalex-snapshot

Syntactic Cut-elimination for Common Knowledge

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.1023/a:1013864621946openalex-snapshot

On the Completeness and Decidability of the Horn‐Like Fragment of the First‐Order Linear Temporal Logic

inferred← citeshttps://doi.org/10.1093/jigpal/jzq023openalex-snapshot

Phase semantics for linear-time formalism

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.1145/2528931openalex-snapshot

Logical foundations for more expressive declarative temporal logic programming languages

inferred← citeshttps://doi.org/10.15388/informatica.2004.067openalex-snapshot

Decision Procedure for Temporal Logic of Belief and Actions

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.4204/eptcs.415.16openalex-snapshot

A Unified Gentzen-style Framework for Until-free LTL

inferred← citeshttps://doi.org/10.4204/eptcs.77.7openalex-snapshot

Cut-elimination for the mu-calculus with one variable

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.