OurBigBook About$ Donate
 Sign in Sign up

Computable Cantor normal form notation

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Ordinal Cantor normal form
2026-10-06  0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (7)

  1. Cantor normal form
  2. Ordinal
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Decidable well-order
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 25 / 5 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook