This is a list of ordinal collapsing functions. Feel free to add any that you invented or others forgot to include to this list!
List
Bachmann's ψ
The first true OCF, Bachmann's
was invented by Heinz Bachmann, somewhat cumbersome as it depends on fundamental sequences for all limit ordinals; yet the full definition has been lost over time. Michael Rathjen has suggested a "recast" of the system, which goes like so:
- Let
represent an uncountable ordinal such as
;
- Then define
and 


is the Bachmann-Howard ordinal, the proof-theoretic ordinal of Kripke-Platek set theory with the axiom of infinity (KP). One can also generalize the definition like so:




Feferman's θ
Feferman's
-functions constitute a hierarchy of single-argument functions
for
. It is often considered a two-argument function with
occasionally written as
. It is defined like so:




The supremum of countable ordinals that can be expressed with this function is the Takeuti-Feferman-Buchholz ordinal
, but an ordinal notation associated to this function is unheard of or nonexistent, unlike for Buchholz's psi function.
Buchholz's ψ
Buchholz's
is a hierarchy of single-argument functions
, with
occasionally abbreviated as
. This function is likely the most well known out of all OCFs. The definition is so:
- Define
and
for
.
- Let
be the set of distinct terms in the Cantor normal form of
(with each term of the form
for
)




The limit of this system is
, the Takeuti-Feferman-Buchholz ordinal.
Extended Buchholz's ψ
This OCF is a sophisticated extension of Buchholz's
by mathematician Denis Maksudov. The limit of this system is much greater, equal to
where
denotes the first omega fixed point, sometimes referred to as Extended Buchholz's ordinal. The function is defined as follows:
- Define
and
for
.




Madore's ψ
This OCF was the same as the ψ function previously used throughout this article; it is a simpler, more efficient version of Buchholz's ψ function defined by David Madore. Its use in this article lead to widespread use of the function.




This function was used by Chris Bird, who also invented the next OCF.
Bird's θ
Chris Bird devised the following shorthand for the extended Veblen function
:

is abbreviated 
This function is only defined for arguments less than
, and its outputs are limited by the small Veblen ordinal.
Wilken's ϑ
Wilken's ϑ is more generic than other OCFs:
- Let
be either 1 or an epsilon number.
- Let
be an uncountable regular cardinal.
- For
, let
be the successor cardinal to
.
- For finite
and
, define the following for
:


for m < k < n


n is needed to define the function, but n does not actually affect the function's behaviour. Therefore, one may safely eliminate n and simply write
.
Wilken and Weiermann's ϑ–
Wilken and Weiermann's ϑ– is closely related to Wilken's ϑ, and their paper closely analyzes the relationship between the two.
- As before, let
be either 1 or an epsilon number.
- Let
be an uncountable regular cardinal.
- For
, let
be the successor cardinal to
.
- Let

- For all
, define the following:




Weiermann's ϑ
This ϑ function has the advantage of having only a single argument, at the cost of some added complexity. This OCF is similar in some ways to Bachmann's ψ and its recast by Rathjen.




Rathjen and Weiermann showed that
is defined for all
, but do not discuss higher values. ϑ follows the archetype of many ordinal collapsing functions — it is defined inductively with a "marriage" to the C function.
Jäger's ψ
Jäger's ψ is a hierarchy of single-argument ordinal functions ψκ indexed by uncountable regular cardinals κ smaller than the least weakly Mahlo cardinal M0 introduced by German mathematician Gerhard Jäger in 1984. It was developed on the base of Buchholz's approach.
- If
for some α < κ,
.
- If
for some α, β < κ,
.

- For any finite n,
is the smallest set satisfying the following:
- The sum of any finitely many ordinals in
belongs to
.
- For any
,
.
- For any
,
.
- For any ordinal γ and uncountable regular cardinal
,
.
- For any
and uncountable regular cardinal
,
.


Simplified Jäger's ψ
This is a sophisticated simplification of Jäger's ψ created by Denis Maksudov. An ordinal is α-weakly inaccessible if it is uncountable, regular and it is a limit of γ-weakly inaccessible cardinals for γ < α. Let I(α, 0) be the first α-weakly inaccessible cardinal, I(α, β + 1) be the first α-weakly inaccessible cardinal after I(α, β) and I(α, β) =
for limit β. Restrict ρ and π to uncountable regular ordinals of the form I(α, 0) or I(α, β + 1). Then,




Rathjen's Ψ
Rathjen's Ψ function is based on the least weakly compact cardinal to create large countable ordinals. For a weakly compact cardinal K, the functions
,
,
, and
are defined in mutual recursion in the following way:
- M0 =
, where Lim denotes the class of limit ordinals.
- For α > 0, Mα is the set
is stationary in 
is the closure of
under addition,
,
given ξ < K,
given ξ < α, and
given
.
.
- For
,
.
Bachmann and Howard's ϑ
Note: This OCF does not seem to have an official name and the above is simply a nickname.
This OCF was introduced by "Emlightened" in an article on the Googology Wikia about ordinal collapsing functions. The definition is like so:
- Let
represent ω1, the first uncountable ordinal.




AndrasKovacs' ψ
This is a variant of Madore's ψ introduced by AndrasKovacs in a piece of code describing large countable ordinals in Agda.