# 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. <http://platonicrealms.com/> - [APA] well-ordering principle (10 Apr 2014). Retrieved 17 Feb 2019 from the
*Platonic Realms Interactive Mathematics Encyclopedia:*http://platonicrealms.com/encyclopedia/well-ordering-principle/