Russell Schema and Paradox

PART 3. Cantor’s paradox.

(test video)
Cantor’s Paradox
●
Every set has a certain size
●
We call this size “cardinality”
●
Just like for ordinals, we have archetype-sets for cardinalities
●
These represent “abstract sets” of various sizes, i.e. without
regard for what kind of things are in the sets, just how many
things are in the sets
●
These are called “cardinals”
Cantor’s Paradox
●
There are two kinds of cardinals:
– Finite (0, 1, 2...)
– Infinite (???)
●
Actually, there are an infinite number of infinite cardinals
●
This is a famous result, due to Cantor
●
(I won’t talk about what different sizes of infinity mean
here. It’s not necessary to understand the paradox.)
Cantor’s Paradox
●
Some important facts about cardinals
●
All cardinals are also ordinals
– but reverse is not true
●
When it came to ordinals, we talked about ordinals
containing all “previous” ordinals
●
In terms of cardinality, this means all cardinals contain all
smaller cardinals
Cantor’s Paradox
●
Now assume there is a set of all cardinals
●
How big is this set?
●
i.e. what is its cardinality and corresponding cardinal?
●