Ordinal collapsing function: Difference between revisions
→History
Line 4:
== History ==
The first ordinal collapsing function in the literature was Bachmann's \( \psi \) function, which was regarded as novel at the time and was used to calibrate the size of the [[Bachmann-Howard ordinal]]. However, the definition is quite cumbersome.
A modern "recast", proposed by Michael Rathjen<ref>Rathjen, Michael. "The Art of Ordinal Analysis"</ref>, is that \( \psi_\Omega(\alpha)\) is the least countable \( \rho \) so that the countable ordinals constructible from \(\Omega\) and the set of ordinals below \( \max(1, \rho) \) using the following operations are all less than \(\rho\): addition, the map \( \xi \mapsto \omega^\xi \), and \( \psi_\Omega \) restricted to inputs less than \( \alpha \). Of course, this definition is condensed, and is usually written in terms of \( C \)-sets. Below is the more formal definition.
* Let \( \Omega = \aleph_1 \) and \( C_0^\Omega(\alpha, \beta) = \beta \cup \{0, \Omega\} \).
| |||