This is an attempt to define and explicit a not-too-complicated ordinal collapsing function which should be useful for pedagogical purposes (to construct large countable ordinals). It presumably defines an ordinal notation up to the Bachmann-Howard ordinal, but I need to check this.
Definition
Let
stand for the first uncountable ordinal, 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
(which will be non-decreasing), 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
.
Computation of values of 
Predicative start
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
.
Similarly,
contains the ordinals which can be formed from
,
,
,
and this time also
, using addition, multiplication and exponentiation. This contains all the ordinals up to
but not the latter, so
. In this manner, we prove that
inductively on
: the proof works, however, only as long as
. We therefore have:
for all
, where
is the smallest fixed point of
.
(Here, the
functions are the Veblen functions defined starting with
.)
Now
but
is no larger, since
cannot be constructed using finite applications of
and thus never belongs to a
set for
, and the function
remains “stuck” at
for some time:
for all
.
First impredicative values
Again,
. However, when we come to computing
, something has changed: since
was (“artificially”) added to all the
, we are permitted to take the value
in the process. So
contains all ordinals which can be built from
,
,
,
, the
function up to
and this time also
itself, using addition, multiplication and exponentiation. The smallest ordinal not in
is
(the smallest
-number after
).
We say that the definition
and the next values of the function
such as
are impredicative because they use ordinals (here,
) greater than the ones which are being defined (here,
).
Values of
up to the Feferman-Schütte ordinal
The fact that
remains true for all
(note, in particular, that
: but since now the ordinal
has been constructed there is nothing to prevent from going beyond this). However, at
(the first fixed point of
beyond
), the construction stops again, because
cannot be constructed from smaller ordinals and
by finitely applying the
function. So we have
.
The same reasoning shows that
for all
, where
enumerates the fixed points of
an
is the first fixed point of
. We then have
.
Again, we can see that
for some time: this remains true until the first fixed point
of
, which is the Feferman-Schütte ordinal. Thus,
is the Feferman-Schütte ordinal.
Beyond the Feferman-Schütte ordinal
We have
for all
where
is the next fixed point of
. So
, for some time, if
enumerates the fixed points in question. This can also be noted
using the many-valued Veblen functions: this gives us a notation for some large ordinals:
is the Ackermann ordinal,
is the “small” Veblen ordinal (the range of the notations
predicatively using finitely many variables),
is the “large” Veblen ordinal (the range of the notations
predicatively using transfinitely many variables),
- the limit
of
,
,
, etc., is the Bachmann-Howard ordinal: after this our function
is constant.