Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-29T19:49:57.404Z Has data issue: false hasContentIssue false
  • English
  • Français

Ordinal recursion

Published online by Cambridge University Press:  24 October 2008

N. A. Routledge
N. A. Routledge
Affiliation:
King's CollegeCambridge
Get access Rights & Permissions [Opens in a new window]

Extract

We consider a certain method of effectively calculating functions of the positive integers, related to the ‘transfinite recursion’ of Ackermann(1). It arises by use of well-ordered series, and one might hope that the functions so generated could be classified according to the ordinal of the series involved, but we shall see that the use of well-ordered series is not at all essential, and in any case no ordinal other than ω need be used. We investigate how any calculable function (that is, general recursive) can be derived by ordinal recursion (as we name our method), and prove a best possible result.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 49 , Issue 2 , April 1953 , pp. 175 - 182
Copyright
Copyright © Cambridge Philosophical Society 1953

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Ackermann, Wilhelm. Zur Widerspruchfreiheit der Zahlentheorie. Math. Ann. 117 (1940), 162–94.CrossRefGoogle Scholar
(2)Kleene, S. C.General recursive functions of natural numbers. Math. Ann. 112 (1936), 727–42.CrossRefGoogle Scholar
(3)Péter, Rósza. Konstruktion nichtrekursiver Funktionen. Math. Ann. 111 (1935), 42–60.CrossRefGoogle Scholar
(4)Péter, Rósza. Rekursive Funktionen (Akadémiai Kiadó, Budapest, 1951).Google Scholar