Part: Ordinal Numbers

Ordinal numbers are a very important and fascinating result of set theory. The idea of ordinal number starts with defining natural numbers not based on the Peano axioms but purely set-theoretically (see set-theoretical definition of natural numbers) using the recursive definition method $$0:=\emptyset,\quad n+1:=n\cup \{n\}.$$ Natural numbers defined like that fulfill the following properties: * Every natural number can be interpreted as a set containing all proceeding natural numbers, i.e. $n\in N$ for all $n < N.$ * The set of natural numbers is well-ordered. These properties bring a big advantage in comparison with defining natural numbers via the Peano axioms. The main advantage is that we can now look for a successor of the set of all natural numbers $$\omega:=\mathbb N=\{0,1,2,3,\ldots,\}$$ which would preserve these two properties, i.e. the set $$\omega +1:=\omega\cup \{\omega\},$$ and then look for a successor of this new set, etc., etc. This allows us to continue the well-ordered set of natural numbers, but with the major difference that we are gradually exceeding the realm of finite natural numbers to infinite sets. In this context, we will be talking about transfinite sets, or just infinite ordinal numbers, while the natural numbers are nothing else but finite ordinal numbers.

Motivations: 1 2 Explanations: 1

  1. Proposition: Transitive Recursion
  2. Definition: Contained Relation "$\in_X$"
  3. Proposition: Contained Relation is a Strict Order
  4. Definition: Transitive Set
  5. Definition: Extensional Relation
  6. Definition: Well-founded Relation
  7. Definition: Mostowski Function and Collapse
  8. Definition: Ordinal Number
  9. Lemma: Properties of Ordinal Numbers
  10. Lemma: Successor of Ordinal
  11. Definition: Limit Ordinal
  12. Definition: The Class of all Ordinals $\Omega$

Explanations: 1
Parts: 2

Thank you to the contributors under CC BY-SA 4.0!