Processing math: 100%

First infinite von Neumann ordinal

Set

definiendum ωN


As is common, I'll also use the symbol N to denote the set theoretic object ωN.

infinite_jest.jpg

Idea

This is probably the most straightforward way to set up a countably infinite set.

Elaboration

The first requirement says that all elements of ωN are either or a successor of another set. The second guaranties that there are no superfluous sets in ωN, apart from the ones which are e.g. required to making ωN an ordinal. Put together the axiom says that ωN contains and for each established element m, it also inductively contains all successors succ mm{m}.

Notation

To model the natural numbers, one can make the following identifications:

  • 0
  • 1succ (0)={}={}{0}={0}
  • 2succ (1)=1{1}={0}{1}={0,1}
  • 3succ (2)=2{2}={0,1}{2}={0,1,2}
  • 4succ (3)=

Using our common language conception of natural numbers we can say: Each number contains the numbers which are less than itself, i.e. n is {0,1,2,3,4,,n1}. Being an ordinal, we can model the order relation of the natural numbers via set inclusion k<nkn. This also gives us the familiar ordinal order.

Reference

Requirements

Subset of

Element of

Link to graph
Log In
Improvements of the human condition