Recall that sets A and B are said to be of the same
cardinality iff there is a bijection from A to B. A set
is finite iff it is of the same cardinality as some set
.
A set is countable iff it's either finite or
of the same cardinality of N =
,
the
natural numbers. As you now know from seeing earlier proofs, both
2
(the power set of the set of natural numbers) and
R (the reals) are uncountable.
Now, the conintuum hypothesis is:
In 1938 Gödel proved that
In 1963 Cohen proved that
So, if we assume that ZFC is consistent, then neither CH nor
CH is
derivable from it. As we will see later, it's a consequence of other
theorems proved by Gödel that for every set
of axioms for set
theory, there exists an assertion
about sets that is such that