Computable Cantor normal form notation
= Computable Cantor normal form notation
Finite canonical terms built from zero, <ordinal> sums and powers of omega describe exactly the <ordinals> below <epsilon zero>. Syntactic validity and comparison are decidable by recursion through the exponent subterms. Enumerating valid term codes transfers their order to a <computable well-order> on all <natural numbers>.