A nonstandard hierarchy comparison theorem for the slow and fast growing hierarchy Universiteit Gent
It is folklore that the slow and fast growing hierarchy match up for the first time at the proof-theoretic ordinal of (Pi^1_1-CA)_0. By results of Schütte and Simpson it is known that the underlying notation system looses its strengths when the ordinal addition function is no longer present. In this article we will show that a hierarchy comparison can still be established. Surprisingly the match of the slow and fast growing hierarchy can be ...