A plus-1 theorem for subsections (Q1113897)

In this paper the author proves an analogue of Sacks' plus-1 theorem for subrecursive hierarchies. If \(<\) is a nice primitive recursive well- ordering of a limit order type then the F-hierarchy over \(<\) is defined for any functional F of type 2 or 3. The \(<\)-subsection of F is defined as all functions primitive recursive in one of the functions in the \(<\)- hierarchy over F. The main result is that to any normal functional F of type 3 there is a normal functional K of type 2 with the same \(<\)- subsection. Using a nice primitive recursive well-ordering of order type \(\epsilon_ 0\) the \(<\)-subsection of F consists of those functions that are Gödel primitive recursive in F. As a corollary it is shown that to any normal functional F of type 3 there exists a normal functional K of type 2 with the same functions being Gödel primitive recursive.