On the public citation graph

Proof Theory and Intuitionistic Systems

https://doi.org/10.1007/bfb0068783
0 signed · 13 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/978-94-017-9217-2_1openalex-snapshot
Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session
inferred← citeshttps://doi.org/10.1007/bf01084980openalex-snapshot
Theory of proofs (arithmetic and analysis)
inferred← citeshttps://doi.org/10.1007/bf01371633openalex-snapshot
On some proof theoretical properties of the modal logic GL
inferred← citeshttps://doi.org/10.1007/bf02011866openalex-snapshot
Choice sequences and reduction processes
inferred← citeshttps://doi.org/10.1007/bf02015375openalex-snapshot
Disjunctive properties of intuitionistic systems
inferred← citeshttps://doi.org/10.1007/bf02123844openalex-snapshot
Bibliografia
inferred← citeshttps://doi.org/10.1007/bfb0066774openalex-snapshot
Notes on intuitionistic second order arithmetic
inferred← citeshttps://doi.org/10.1007/bfb0079560openalex-snapshot
Bemerkungen zu Regel und Schema
inferred← citeshttps://doi.org/10.1016/0003-4843(72)90014-9openalex-snapshot
Induction and transfinite induction in intuitionistic systems
inferred← citeshttps://doi.org/10.1016/0003-4843(73)90008-9openalex-snapshot
On barinduction of higher types for decidable predicates
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90055-3openalex-snapshot
Proof-theoretical analysis: weak systems of functions and classes
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103314openalex-snapshot
Choice and independence of premise rules in intuitionistic set theory
inferred← citeshttps://doi.org/10.2969/jmsj/02920327openalex-snapshot
A normalization theorem in formal theories of natural numbers
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.