Difference between revisions of "Recursions of higher degrees"
Ulf Rehmann (talk | contribs) m (MR/ZBL numbers added) |
(TeX) |
||
| Line 1: | Line 1: | ||
| + | {{TEX|done}} | ||
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 | 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 | ||
| − | + | $$V_{x_1,\dots,x_n}(a_1,\dots,a_n,f(x_1,\dots,x_n))=f(a_1,\dots,a_n),$$ | |
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. | 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. | ||
Revision as of 18:08, 18 September 2014
Recursive definitions (cf. 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
$$V_{x_1,\dots,x_n}(a_1,\dots,a_n,f(x_1,\dots,x_n))=f(a_1,\dots,a_n),$$
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 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
| [1] | R. Peter, "Recursive functions" , Acad. Press (1967) (Translated from German) MR0219414 Zbl 0154.00601 |
Comments
References
| [a1] | S.C. Kleene, "Introduction to metamathematics" , North-Holland (1950) pp. 234 MR1234051 MR1570642 MR0051790 Zbl 0875.03002 Zbl 0604.03002 Zbl 0109.00509 Zbl 0047.00703 |
| [a2] | P. Odifreddi, "Classical recursion theory" , North-Holland (1989) pp. Chapt. II; esp. pp. 199ff MR0982269 Zbl 0661.03029 |
Recursions of higher degrees. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Recursions_of_higher_degrees&oldid=24547