A classification of the ordinal recursive functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3451841 (Why is no real title available?)
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- Nested recursion
- On provably recursive functions and ordinal recursive functions
- On the interpretation of non-finitist proofs–Part II
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(33)- Classifying the phase transition threshold for Ackermannian functions
- Ordinal recursive bounds for Higman's theorem
- Complexity of algorithms and computations
- Unprovable combinatorial statements
- Increase of the complexity of functions by an application of multiple recursion
- A solution to Kronecker's problem
- Bootstrapping the primitive recursive functions by only 27 colors
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- Transfinite induction within Peano arithmetic
- Proof theory and ordinal analysis
- Slow reflection
- Ackermann's substitution method (remixed)
- Herbrand analyses
- Complexity hierarchies beyond elementary
- Mass Problems and Randomness
- Classifying the Provably Total Functions of PA
- The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete
- A decidable subclass of the minimal Gödel class with identity
- An Unprovable Ramsey-Type Theorem
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
- A Model-Theoretic Approach to Ordinal Analysis
- Ideal membership in polynomial rings over the integers
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- Minimal readability of intuitionistic arithmetic and elementary analysis
- How to characterize provably total functions by local predicativity
- scientific article; zbMATH DE number 7577570 (Why is no real title available?)
- Proof lengths for instances of the Paris-Harrington principle
- Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
- Long finite sequences
- Sharp thresholds for hypergraph regressive Ramsey numbers
- Mass problems associated with effectively closed sets
- Informal versus formal mathematics
- Inductive full satisfaction classes
This page was built for publication: A classification of the ordinal recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5635436)
