Slow Growing Versus Fast Growing
暂无分享,去创建一个
I falsely claimed, as an aside remark in [8] and also implicitly in the abstract [9], that the slow-growing hierarchy “catches up” with the fast-growing hierarchy at level Γ 0 , i.e. that, for all x > 0, where x ′ is some simple (even linear) function of x . Girard [4] gave the first correct analysis of the deep relationship which exists between G and F , based on his extensive category-theoretic framework for -logic. This analysis indicates that the first point at which G catches up with F is the ordinal of the theory ID ω (0 of arbitrary finite iterations of an inductive definition. This is very far beyond Γ 0 ! In particular, in order to capture F at level ∣ID n ∣ the slow-growing hierarchy must be generated up to ∣ID n +1 ∣, i.e. one extra iteration of an inductive definition is needed in order to generate sufficient new ordinals.
[1] Stanley S. Wainer,et al. Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy , 1972, Journal of Symbolic Logic.
[2] Jean-Yves Girard,et al. Π12-logic, Part 1: Dilators , 1981 .
[3] E. A. Cichon,et al. The slow-growing and the Graegorczyk hierarchies , 1983, Journal of Symbolic Logic.