Eine Klassifikation der ε0‐Rekursiven Funktionen
From MaRDI portal
Publication:5639704
DOI10.1002/malq.19710170113zbMath0232.02028OpenAlexW2029816444MaRDI QIDQ5639704
Publication date: 1971
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19710170113
Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Majorizing provably recursive functions in fragments of PA, Herbrand analyses, Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, The realm of primitive recursion, Slow reflection, Ordinal recursive bounds for Higman's theorem, Sharp thresholds for hypergraph regressive Ramsey numbers, Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie, Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy, How to characterize provably total functions by local predicativity, Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths, Proof lengths for instances of the Paris-Harrington principle, Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem, Built-up systems of fundamental sequences and hierarchies of number-theoretic functions, Unnamed Item, Classifying the phase transition threshold for Ackermannian functions, Orders, reduction graphs and spectra, On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising, P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
