Well-ordering theorem

Well-ordering theorem

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In mathematics, the well-ordering theorem, also known as Zermelo's theorem, states that every set can be well-ordered. A set X is well-ordered by a strict total order if every non-empty subset of X has a least element under the ordering.

Excerpt from the Wikipedia article “Well-ordering theorem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Well-ordering theorem to your collection.

Play for free

Related cards