Slow growing versus fast growing

DOI10.2307/2274873zbMath0701.03029OpenAlexW2159855438MaRDI QIDQ3478403

Stanley S. Wainer

Publication date: 1989

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274873

zbMATH Keywords

slow growing hierarchyfast-growing hierarchyfinite interaction of an inductive definition

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15)

Related Items (7)

Equational derivation vs. computation ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ The hierarchy of terminating recursive programs over N ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths ⋮ Term rewriting theory for the primitive recursive functions ⋮ Ordinal complexity of recursive definitions

Cites Work

• The slow-growing and the Graegorczyk hierarchies
• Π12-logic, Part 1: Dilators
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy

This page was built for publication: Slow growing versus fast growing