A classification of the ordinal recursive functions

DOI10.1007/BF01973619zbMath0228.02027OpenAlexW2089195129MaRDI QIDQ5635436

Stanley S. Wainer

Publication date: 1970

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137841

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Hierarchies of computability and definability (03D55)

Related Items (33)

A solution to Kronecker's problem ⋮ Bootstrapping the primitive recursive functions by only 27 colors ⋮ Herbrand analyses ⋮ The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ Transfinite induction within Peano arithmetic ⋮ Slow reflection ⋮ Ordinal recursive bounds for Higman's theorem ⋮ A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods ⋮ Informal versus formal mathematics ⋮ Sharp thresholds for hypergraph regressive Ramsey numbers ⋮ Complexity of algorithms and computations ⋮ A Model-Theoretic Approach to Ordinal Analysis ⋮ Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy ⋮ Minimal readability of intuitionistic arithmetic and elementary analysis ⋮ How to characterize provably total functions by local predicativity ⋮ Inductive full satisfaction classes ⋮ Unprovable combinatorial statements ⋮ Proof lengths for instances of the Paris-Harrington principle ⋮ Long finite sequences ⋮ Proof theory and ordinal analysis ⋮ Ackermann's substitution method (remixed) ⋮ An Unprovable Ramsey-Type Theorem ⋮ Increase of the complexity of functions by an application of multiple recursion ⋮ Unnamed Item ⋮ Mass Problems and Randomness ⋮ Classifying the phase transition threshold for Ackermannian functions ⋮ Ideal membership in polynomial rings over the integers ⋮ Complexity Hierarchies beyond Elementary ⋮ Mass problems associated with effectively closed sets ⋮ Classifying the Provably Total Functions of PA ⋮ A decidable subclass of the minimal Gödel class with identity ⋮ P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property

Cites Work

• Nested recursion
• On provably recursive functions and ordinal recursive functions
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• On the interpretation of non-finitist proofs–Part II
• Unnamed Item
• Unnamed Item

This page was built for publication: A classification of the ordinal recursive functions