For every ordinal base , a nonzero ordinal has a unique finite ordinal addition expansion with strictly decreasing exponents and coefficients . Choose the largest power at most the remaining ordinal and apply the ordinal division algorithm. The next remainder has smaller leading exponent, so well-foundedness forces termination. Each lower tail is smaller than its preceding power; uniqueness of division consequently fixes the exponent, coefficient and tail successively. For this is Cantor normal form.
Articles by others on the same topic
There are currently no matching articles.