On the public citation graph
A classification of the ordinal recursive functions
0 signed · 76 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1111/j.1746-8361.1958.tb01464.xopenalex-snapshot
Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes
inferredcites →https://doi.org/10.2307/2267457openalex-snapshot
On the interpretation of non-finitist proofs–Part II
inferredcites →https://doi.org/10.2969/jmsj/02030456openalex-snapshot
On provably recursive functions and ordinal recursive functions*
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.19890350504openalex-snapshot
On the End Extension Problem For Δ0‐PA(S)
inferred← citeshttps://doi.org/10.1002/malq.19900360509openalex-snapshot
More on induction in the language with a satisfaction class
inferred← citeshttps://doi.org/10.1002/malq.19940400212openalex-snapshot
A Uniform Approach to Fundamental Sequences and Hierarchies
inferred← citeshttps://doi.org/10.1006/inco.1996.0068openalex-snapshot
Self-Monitoring Machines and anωωHierarchy of Loops
inferred← citeshttps://doi.org/10.1007/11780342_57openalex-snapshot
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-55368-4_15openalex-snapshot
Peano Arithmetic and $$ \epsilon _0$$
inferred← citeshttps://doi.org/10.1007/978-3-031-64217-3_10openalex-snapshot
Consistency of PA and $$\varepsilon _0$$ Induction
inferred← citeshttps://doi.org/10.1007/978-3-319-01315-2_8openalex-snapshot
Rapidly Growing Ramsey Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_9openalex-snapshot
Goodstein’s Theorem Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_1openalex-snapshot
Complexity Bounds for Ordinal-Based Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_16openalex-snapshot
Combinatorial Statements Independent of Arithmetic
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-662-21963-8_14openalex-snapshot
How to characterize provably total functions by the Buchholz operator method
inferred← citeshttps://doi.org/10.1007/978-3-662-21963-8_15openalex-snapshot
Completeness has to be restricted: Gödel's interpretation of the parameter t
inferred← citeshttps://doi.org/10.1007/978-94-011-5108-5_22openalex-snapshot
The Contribution of Polish Logicians to Recursion Theory
inferred← citeshttps://doi.org/10.1007/bf01084072openalex-snapshot
Increase of the complexity of functions by an application of multiple recursion
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01387511openalex-snapshot
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
inferred← citeshttps://doi.org/10.1007/bfb0099482openalex-snapshot
Subrecursive hierarchies via direct limits
inferred← citeshttps://doi.org/10.1007/s11229-006-9126-9openalex-snapshot
Informal versus formal mathematics
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90686-aopenalex-snapshot
Unprovable combinatorial statements
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90035-zopenalex-snapshot
Inductive full satisfaction classes
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00029-gopenalex-snapshot
Transfinite induction within Peano arithmetic
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50027-0openalex-snapshot
10.1016/b978-044488002-4/50027-0
inferred← citeshttps://doi.org/10.1016/j.apal.2005.09.016openalex-snapshot
Ackermann’s substitution method (remixed)
inferred← citeshttps://doi.org/10.1016/j.apal.2007.02.004openalex-snapshot
Classifying the phase transition threshold for Ackermannian functions
inferred← citeshttps://doi.org/10.1016/j.apal.2017.01.004openalex-snapshot
Proof lengths for instances of the Paris–Harrington principle
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.10.005openalex-snapshot
The fixed initial credit problem for partial-observation energy games is Ack-complete
inferred← citeshttps://doi.org/10.1016/j.jcta.2010.08.004openalex-snapshot
Sharp thresholds for hypergraph regressive Ramsey numbers
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)87041-0openalex-snapshot
Bootstrapping the primitive recursive functions by only 27 colors
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80018-9openalex-snapshot
Hierarchies of Provably Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80032-9openalex-snapshot
Classifying Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00009-1openalex-snapshot
Ordinal recursive bounds for Higman's theorem
inferred← citeshttps://doi.org/10.1023/a:1005244002066openalex-snapshot
Is There A Simple, Pedestrian Arithmetic Sentence Which Is Independent Of Zfc?
inferred← citeshttps://doi.org/10.1090/conm/065/891248openalex-snapshot
Provably computable functions and the fast growing hierarchy
inferred← citeshttps://doi.org/10.1090/s0002-9939-03-07086-2openalex-snapshot
A classification of rapidly growing Ramsey functions
inferred← citeshttps://doi.org/10.1090/s0002-9939-1983-0687646-0openalex-snapshot
A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
inferred← citeshttps://doi.org/10.1090/s0002-9939-1992-1095225-4openalex-snapshot
An Unprovable Ramsey-Type Theorem
inferred← citeshttps://doi.org/10.1090/s0002-9947-1977-0498045-0openalex-snapshot
P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
inferred← citeshttps://doi.org/10.1090/s0894-0347-04-00451-5openalex-snapshot
Ideal membership in polynomial rings over the integers
inferred← citeshttps://doi.org/10.1109/lics.1991.151643openalex-snapshot
Freyd's hierarchy of combinator monoids
inferred← citeshttps://doi.org/10.1109/lics.2008.47openalex-snapshot
The Ordinal Recursive Complexity of Lossy Channel Systems
inferred← citeshttps://doi.org/10.1142/9789812796554_0017openalex-snapshot
SOME FUNDAMENTAL ISSUES CONCERNING DEGREES OF UNSOLVABILITY
inferred← citeshttps://doi.org/10.1145/2858784openalex-snapshot
Complexity Hierarchies beyond Elementary
inferred← citeshttps://doi.org/10.1145/2933575.2933593openalex-snapshot
The Complexity of Coverability in ν-Petri Nets
inferred← citeshttps://doi.org/10.1145/322358.322370openalex-snapshot
The Expressiveness of Simple and Second-Order Type Structures
inferred← citeshttps://doi.org/10.1145/3798129.3806376openalex-snapshot
Determination of the Fifth Busy Beaver Value
inferred← citeshttps://doi.org/10.1145/800135.804411openalex-snapshot
A programming language theorem which is independent of Peano Arithmetic
inferred← citeshttps://doi.org/10.2178/bsl/1146620058openalex-snapshot
Classifying the Provably Total Functions of PA
inferred← citeshttps://doi.org/10.2307/2272973openalex-snapshot
Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
inferred← citeshttps://doi.org/10.2307/2274275openalex-snapshot
A decidable subclass of the minimal Gödel class with identity
inferred← citeshttps://doi.org/10.2307/2275597openalex-snapshot
How to characterize provably total functions by local predicativity
inferred← citeshttps://doi.org/10.2307/2275884openalex-snapshot
Minimal readability of intuitionistic arithmetic and elementary analysis
inferred← citeshttps://doi.org/10.2307/421195openalex-snapshot
A Model-Theoretic Approach to Ordinal Analysis
inferred← citeshttps://doi.org/10.2748/tmj/1325886278openalex-snapshot
Mass problems associated with effectively closed sets
inferred← citeshttps://doi.org/10.2969/jmsj/03840721openalex-snapshot
Provably recursive functions in fragments of Peano arithmetic
inferred← citeshttps://doi.org/10.4467/20842589rm.14.005.2275openalex-snapshot
RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:6)2022openalex-snapshot
Fusible numbers and Peano Arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1708.05640openalex-snapshot
A similarity criterion for sequential programs using truth-preserving partial functions
inferred← citeshttps://doi.org/10.48550/arxiv.math/0006079openalex-snapshot
On the consistency of $P=NP$ with fragments of ZFC whose own consistency strength can be measured by an ordinal assignment
inferred← citeshttps://doi.org/10.70675/ac4131abz125bz48a0zb249z94e706479cddopenalex-snapshot
On Post’s embedding problem and the complexity of lossy channels
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.