Ordinal collapsing function: Difference between revisions
→History
IDoNotExist (talk | contribs) |
|||
(One intermediate revision by one other user not shown) | |||
Line 4:
== History ==
The first ordinal collapsing function in the literature was Bachmann's \( \
A modern "recast", proposed by Michael Rathjen<ref name="RathjenArt">Rathjen, Michael. "[https://www1.maths.leeds.ac.uk/~rathjen/ICMend.pdf 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\} \).
|