The slow-growing and the Graegorczyk hierarchies
From MaRDI portal
Publication:3682477
DOI10.2307/2273557zbMath0567.03020OpenAlexW2100730815WikidataQ59409083 ScholiaQ59409083MaRDI QIDQ3682477
E. A. Cichon, Stanley S. Wainer
Publication date: 1983
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273557
Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems, Equational derivation vs. computation, Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, Slow growing versus fast growing, The intrinsic difficulty of recursive functions, Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal, Natural well-orderings, What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory, Finite presentability of strongly finite dilators, Term rewriting theory for the primitive recursive functions, Some interesting connections between the slow growing hierarchy and the Ackermann function, Proof theory and ordinal analysis, GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION
Cites Work
