On the public citation graph

Nested recursion

https://doi.org/10.1007/bf01342980
0 signed · 42 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/bf01450016openalex-snapshot
Zur Widerspruchsfreiheit der Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01564760openalex-snapshot
Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
inferredcites →https://doi.org/10.1017/s0305004100028255openalex-snapshot
Ordinal recursion
inferredcites →https://doi.org/10.1515/9783112573082openalex-snapshot
Rekursive Funktionen
inferredcites →https://doi.org/10.2307/2267457openalex-snapshot
On the interpretation of non-finitist proofs–Part II

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19770232708openalex-snapshot
Ausgezeichnete Folgen Für Prädikative Ordinalzahlen und Prädikativ‐Rekursive Funktionen
inferred← citeshttps://doi.org/10.1006/jcta.2000.3154openalex-snapshot
Long Finite Sequences
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_90openalex-snapshot
The hierarchy of terminating recursive programs over N
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_8openalex-snapshot
Unfolding Schematic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_6openalex-snapshot
Computability — Logical and Recursive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_11openalex-snapshot
The Proof Theoretic Complexity of Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-94-009-8937-5_10openalex-snapshot
Constructive Sequent Reduction in Gentzen’s First Consistency Proof for Arithmetic
inferred← citeshttps://doi.org/10.1007/bf01621477openalex-snapshot
Herbrand analyses
inferred← citeshttps://doi.org/10.1007/bf01973619openalex-snapshot
A classification of the ordinal recursive functions
inferred← citeshttps://doi.org/10.1007/bf02007139openalex-snapshot
Pa-Beweisbare ∀∃-Formeln
inferred← citeshttps://doi.org/10.1007/bf02008530openalex-snapshot
Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie
inferred← citeshttps://doi.org/10.1007/bfb0028033openalex-snapshot
A simple ordinal recursive normalization of Gödel's T
inferred← citeshttps://doi.org/10.1007/bfb0090729openalex-snapshot
Computability of ordinal recursion of type level two
inferred← citeshttps://doi.org/10.1007/s00153-010-0225-4openalex-snapshot
Exact bounds on epsilon processes
inferred← citeshttps://doi.org/10.1007/s10516-021-09561-8openalex-snapshot
The Limits of Computation
inferred← citeshttps://doi.org/10.1016/0168-0072(85)90031-4openalex-snapshot
Reduction of higher type levels by means of an ordinal analysis of finite terms
inferred← citeshttps://doi.org/10.1016/0315-0860(79)90024-7openalex-snapshot
The first example of a recursive function which is not primitive recursive
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90027-dopenalex-snapshot
Ordinal complexity of recursive definitions
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70773-0openalex-snapshot
Principles of Proof and Ordinals Implicit in Given Concepts
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70685-8openalex-snapshot
The Use of Ordinals in the Constructive Foundations of Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80032-9openalex-snapshot
Classifying Recursive Functions
inferred← citeshttps://doi.org/10.1017/9781316755983.020openalex-snapshot
Remarks on finitism
inferred← citeshttps://doi.org/10.1017/jsl.2017.71openalex-snapshot
A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION
inferred← citeshttps://doi.org/10.1017/s1755020310000183openalex-snapshot
UNFOLDING FINITIST ARITHMETIC
inferred← citeshttps://doi.org/10.1080/01445340.2015.1028146openalex-snapshot
Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem
inferred← citeshttps://doi.org/10.1090/s0002-9939-1969-0265156-5openalex-snapshot
Reducing Ordinal Recursion
inferred← citeshttps://doi.org/10.1090/s0002-9947-1962-0142453-3openalex-snapshot
Classifications of Recursive Functions by Means of Hierarchies
inferred← citeshttps://doi.org/10.1093/logcom/exy003openalex-snapshot
The strength of SCT soundness
inferred← citeshttps://doi.org/10.1093/oso/9780198500759.003.0036openalex-snapshot
References
inferred← citeshttps://doi.org/10.1111/j.1746-8361.2008.01136.xopenalex-snapshot
Lieber Herr Bernays! Lieber Herr Gödel! Gödel on Finitism, Constructivity, and Hilbert's Program
inferred← citeshttps://doi.org/10.1145/91556.91675openalex-snapshot
Discrete polymorphism
inferred← citeshttps://doi.org/10.2307/2270132openalex-snapshot
Functionals defined by transfinite recursion
inferred← citeshttps://doi.org/10.2307/2272731openalex-snapshot
On n-quantifier induction
inferred← citeshttps://doi.org/10.2307/2272973openalex-snapshot
Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
inferred← citeshttps://doi.org/10.2307/2273149openalex-snapshot
On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising
inferred← citeshttps://doi.org/10.2307/2274857openalex-snapshot
Undecidable complexity statements in -arithmetic
inferred← citeshttps://doi.org/10.2307/2275884openalex-snapshot
Minimal readability of intuitionistic arithmetic and elementary analysis
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.