On the public citation graph

A logic program for transforming sequent proofs to natural deduction proofs

https://doi.org/10.1007/bfb0038694
0 signed · 26 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/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferredcites →https://doi.org/10.1007/bfb0012823openalex-snapshot
Specifying theorem provers in a higher-order logic programming language
inferredcites →https://doi.org/10.1016/0003-4843(74)90010-2openalex-snapshot
The correspondence between cut-elimination and normalization
inferredcites →https://doi.org/10.1016/0168-0072(91)90068-wopenalex-snapshot
Uniform proofs as a foundation for logic programming
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/s0003-4843(70)80005-5openalex-snapshot
Logic with the quantifier “there exist uncountably many”
inferredcites →https://doi.org/10.1016/s0003-4843(77)80004-1openalex-snapshot
Normalization as a homomorphic image of cut-elimination
inferredcites →https://doi.org/10.1016/s0049-237x(08)70822-xopenalex-snapshot
3. Investigations into Logical Deduction
inferredcites →https://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot
Ideas and Results in Proof Theory
inferredcites →https://doi.org/10.1093/oso/9780198505242.001.0001openalex-snapshot
Elements of Intuitionism
inferredcites →https://doi.org/10.1111/j.1468-0149.1978.tb00089.xopenalex-snapshot
ELEMENTS OF INTUITIONISM
inferredcites →https://doi.org/10.1145/96559.96570openalex-snapshot
Higher-order Horn clauses
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1996.0094openalex-snapshot
Interactive Theorem Proving with Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_24openalex-snapshot
Abstract syntax and logic programming
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_13openalex-snapshot
The π-calculus as a theory in linear logic: Preliminary results
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_8openalex-snapshot
Normal Forms and Cut-Free Proofs as Natural Transformations
inferred← citeshttps://doi.org/10.1007/bf00881873openalex-snapshot
Set theory for verification: I. From foundations to functions
inferred← citeshttps://doi.org/10.1007/bf00881900openalex-snapshot
Implementing tactics and tacticals in a higher-order logic programming language
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00060-4openalex-snapshot
Interpolation theorems for intuitionistic predicate logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00244-8openalex-snapshot
Representing scope in intuitionistic deductions
inferred← citeshttps://doi.org/10.1017/9781316755921.010openalex-snapshot
Linear logic as a framework for specifying sequent calculus
inferred← citeshttps://doi.org/10.1112/s1461157000000188openalex-snapshot
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
inferred← citeshttps://doi.org/10.1145/142868.143760openalex-snapshot
Real theorem provers deserve real user-interfaces
inferred← citeshttps://doi.org/10.2307/2275431openalex-snapshot
Contraction-free sequent calculi for intuitionistic logic
inferred← citeshttps://doi.org/10.48456/tr-286openalex-snapshot
Isabelle’s object-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.