On the public citation graph

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

0 signed · 15 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/3-540-09526-8_17openalex-snapshot

Completeness problems in verification of programs and program schemes

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

Mathematical Foundations of Computer Science 1980

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

The saturated tableaux for linear miniscoped horn-like temporal logic

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

Saturated calculus for Horn-like sequents of a complete class of a linear temporal first order logic

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

Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas

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

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

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

Saturation replaces induction for a miniscoped linear temporal logic

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-022-10010-9openalex-snapshot

Loop-Check Specification for a Sequent Calculus of Temporal Logic

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

The Recursion Scheme from the Cofree Recursive Comonad

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

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.