Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T22:41:08.410Z Has data issue: false hasContentIssue false

Ordinal recursion

Published online by Cambridge University Press:  24 October 2008

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

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1953