well-ordering principle

The statement that every set can be well-ordered is called the well-ordering principle. It is not a theorem, but an axiom of set theory equivalent to the axiom of choice.

Any countable set can be well-ordered by mapping it to the set of natural numbers, so the principle becomes more interesting when it is applied to uncountable sets, such as the set of real numbers, because even when the principle is assumed it can be shown that there is no formula for expressing such an order.

Citation Info

  • [MLA] “well-ordering principle.” Platonic Realms Interactive Mathematics Encyclopedia. Platonic Realms, 10 Apr 2014. Web. 17 Feb 2019. <>
  • [APA] well-ordering principle (10 Apr 2014). Retrieved 17 Feb 2019 from the Platonic Realms Interactive Mathematics Encyclopedia:


Get the ultimate math study-guide Math & Me: Embracing Successproduct thumbnail image Available in the Math Store
detail from Escher pic Belvedere

Are you a mathematical artist?

Platonic Realms is preparing an online gallery space to showcase and market the works of painters, sculptors, and other artists working in a tangible medium.

If your work celebrates mathematical themes we want to hear from you!

Please let us know about yourself using the contact page.