If a normal ordinal function defined on all ordinals begins at a countable value and preserves countability from to , transfinite induction shows it maps all countable ordinals to countable ordinals. At countable limits this uses countable unions of countable sets, hence axiom of countable choice in the usual proof. Iteration from zero either stabilizes at a countable fixed point or has a countable limit fixed by continuity. Applying this to gives the countable epsilon number .
Articles by others on the same topic
There are currently no matching articles.