View source for Recursions of higher degrees

Recursive definitions (cf. [[Recursive definition|Recursive definition]]) that, in addition to numerical functions, use some functions of higher types as auxiliary objects. For example, in the case of recursion of the second degree such are the  "substituting"  functionals of type

<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080220/r0802201.png" /></td> </tr></table>

as well as functionals that can be obtained from these by this recursion. The interesting property of recursion of higher degree is that [[Multiple recursion|multiple recursion]] can be reduced to single recursion using a transition to a higher degree. This forms the basis for the method of reducing multiple recursions to a normal form. It should be borne in mind that the terminology in this field is not definitely established. In particular, the term  "recursions of higher degrees"  is sometimes taken to mean normal forms of multiple recursions.

====References====
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  R. Peter,   "Recursive functions" , Acad. Press  (1967)  (Translated from German)</TD></TR></table>



====Comments====


====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  S.C. Kleene,   "Introduction to metamathematics" , North-Holland  (1950)  pp. 234</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top">  P. Odifreddi,   "Classical recursion theory" , North-Holland  (1989)  pp. Chapt. II; esp. pp. 199ff</TD></TR></table>