The Early Development of Set Theory (Stanford Encyclopedia of Philosophy)
The Early Development of Set Theory (Stanford Encyclopedia of Philosophy)
The Early Development of Set Theory (Stanford Encyclopedia of Philosophy)
Philosophy
The Early
Development of
Set Theory
First published Tue Apr 10, 2007;
substantive revision Thu Jun 18, 2020
1. Emergence
2. Consolidation
3. Critical Period
4. From Zermelo to Gödel
Bibliography
Cited Works
Further Reading
Academic Tools
Other Internet Resources
Related Entries
1. Emergence
The concept of a set appears deceivingly simple, at least to
the trained mathematician, and to such an extent that it
becomes difficult to judge and appreciate correctly the
contributions of the pioneers. What cost them much effort
to produce, and took the mathematical community
considerable time to accept, may seem to us rather self-
explanatory or even trivial. Three historical misconceptions
that are widespread in the literature should be noted at the
outset:
infinite and have its own limit points (see Cantor’s paper in
Ewald [1996, vol. 2, 840ff], esp. p. 848). Thus one can iterate
the operation and obtain further derived sets P , P … P
′′ ′′′ (n)
P
(∞)
as the intersection of all P for finite n. This was
(n)
In 1895 and 1897, Cantor published his last two articles. They
were a well-organized presentation of his results on the
transfinite numbers (cardinals and ordinals) and their theory,
and also on order types and well-ordered sets. However,
these papers did not advance significant new ideas.
Unfortunately, Cantor had doubts about a third part he had
prepared, which would have discussed very important issues
having to do with the problem of well-ordering and the
paradoxes (see below). Surprisingly, Cantor also failed to
include in the 1895/97 papers a theorem which he had
published some years before which is known simply as
Cantor’s Theorem: given any set S , there exists another set
whose cardinality is greater (this is the power set P(S), as we
now say—Cantor used instead the set of all functions of the
form f : S → {0, 1}, which is equivalent). In the same short
paper (1892), Cantor presented his famous proof that R is
non-denumerable by the method of diagonalisation, a
method which he then extended to prove Cantor’s
Theorem. (A related form of argument had appeared earlier
in the work of P. du Bois-Reymond [1875], see among others
[Wang 1974, 570] and [Borel 1898], Note II.)
(β) N = ϕo {1}
(γ) 1 ∉ ϕ(N )
3. Critical Period
In the late nineteenth century, it was a widespread idea that
pure mathematics is nothing but an elaborate form of
arithmetic. Thus it was usual to talk about the
“arithmetisation” of mathematics, and how it had brought
about the highest standards of rigor. With Dedekind and
Hilbert, this viewpoint led to the idea of grounding all of
pure mathematics in set theory. The most difficult steps in
bringing forth this viewpoint had been the establishment of
a theory of the real numbers, and a set-theoretic reduction
of the natural numbers. Both problems had been solved by
the work of Cantor and Dedekind. But precisely when
mathematicians were celebrating that “full rigor” had been
finally attained, serious problems emerged for the
foundations of set theory. First Cantor, and then Russell,
discovered the paradoxes in set theory.
the 1920s much work was done on these new types of sets,
mainly by Polish mathematicians around Sierpiński and by
the Russian school of Lusin and his students. A crucial result
obtained by Sierpiński was that every Σ set is the union of
1
2
ℵ Borel sets (the same holds for Σ sets), but this kind of
1
1 1
Also, with Gödel’s work around 1940 (and also with forcing
in the 1960s) it became clear why the research of the 1920s
and 30s had stagnated: the fundamental new independence
results showed that the theorems established by Suslin
(perfect set property for analytic sets), Sierpinski (Σ sets as
1
2
The next crucial steps into the “very high” infinite were
done in 1930. The notion of strongly inaccessible cardinals
was then isolated by Sierpiński & Tarski, and by Zermelo
[1930]. A strong inaccessible is a regular cardinal α such that
2 is less than α whenever x < α. While weak inaccessibles
x
Bibliography
Cited Works
Further Reading
Related Entries
category theory | continuity and infinitesimals | Dedekind,
Richard: contributions to the foundations of mathematics |
Frege, Gottlob | Hilbert, David: program in the foundations
of mathematics | paradoxes: and contemporary logic |
Principia Mathematica | Russell, Bertrand | Russell’s paradox
| set theory | set theory: continuum hypothesis | set theory:
Zermelo’s axiomatization of | Whitehead, Alfred North
Copyright © 2020 by
José Ferreirós <josef@us.es>
Open access to the SEP is made possible by a world-wide
funding initiative.
The Encyclopedia Now Needs Your Support
Please Read How You Can Help Keep the Encyclopedia Free