This is an old revision of this page, as edited by Gro-Tsen(talk | contribs) at 17:00, 10 March 2008(Explain computation of ψ(0)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 17:00, 10 March 2008 by Gro-Tsen(talk | contribs)(Explain computation of ψ(0))
Let stand for the first uncountableordinal, or, in fact, any ordinal guaranteed to be greater than all the countable ordinals which will be constructed (for example, the Church-Kleene ordinal is adequate for our purposes).
We define a function , taking an arbitrary ordinal to a countable ordinal , recursively on , as follows:
Assume has been defined for all , and we wish to define .
Let be the set of ordinals generated starting from , , and by recursively applying the following functions: ordinal addition, multiplication and exponentiation and the function , i.e., the restriction of to ordinals . (Formally, we define and inductively for all integers and we let be the union of the for all .)
Then is defined as the smallest ordinal not belonging to .
Examples
First consider . It contains ordinals , , , , , , , , , , , , and so on. It also contains such ordinals as , , , . The first ordinal which it does not contain is (which is the limit of , , and so on — less than by assumption). The upper bound of the ordinals it contains is (the limit of , , and so on), but that is not so important. This shows that .