Abstract
The year of birth of set theory can be regarded as 1872. In this year, Georg Cantor introduced the notion of a transfinite (infinite) ordinal number His investigations, which soon made set theory an independent area of mathematics, met with mistrust and sometimes open hostility from other mathematicians. At the start of the last decade of the century, set theory came into vogue and was being applied more and more extensively to analysis and geometry. Just when Cantor had found high recognition, and when he had put the finishing touches to his investigations, he himself discovered the first antinomy in his system, which was also found two years later, in 1897, by Burali-Forti. Neither of them could offer any solution, but they did not take the problem too seriously, since it arose in a pretty technical area, namely, the theory of well-ordered sets. They believed that a revision of proofs and theorems could settle the situation, as was often the case earlier, under similar circumstances. These hopes were radically dashed when, in 1902, Bertrand Russell published his famous antinomy which occurred just at the beginning of set theoretical investigations and demonstrated that something wasn’t right in the foundations of that discipline. The disclosure of that antinomy led to a foundational crisis in mathematics. Several ways out of this crisis have been developed, the most successful one being without any doubt the axiomatic method. And amongst the various axiomatic systems of set theory, the system which was begun by Zermelo and completed by Fraenkel and Skolem is, adding the axiom of choice, perhaps the most known and the most practical one. The results of our book are set forth in this theory, denoted by ZFC, the axioms of which are represented below. We always begin with a naive formulation of the particular axiom of ZFC and will then make precise the notion of a “property” occurring in two axioms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference
Note that this assertion needs no axiom if a function of the form f: A — B from the set A into a set B in the usual sense is given, since in this case its range is a set by a comprehension axiom. We don’t need the replacements axioms before we assign, by a functional property, to each member of a given set a certain set, and do not know at the beginning that these “values” are members of another fixed set.
If a and b are sets, then also a x b (see below) is a set. As a subclass of P(A x U A), HA is a set by (A5), (A6) and (A3). Note that
This usage of the word “implies” is a conventional part of mathematical jargon, but it is not exactly the way the rest of the world uses the word.
For the definitions of Func, ran and F r x, see below.
By our conventions, this is the formula Vz(z Ex z E x).
In most cases we will make no difference between partial orderings and strict partial orderings. For any partial ordering R, we get a strict partial ordering R’ via xR’y: xRy A x y, and conversely, any strict partial ordering R’ yields a partial ordering R by xRy: xR’yVx=y.
Has an E-minimal element, say To. Thus ao To and ao To and To ¢ ao. The contradiction will have arrived if we show ao = To. Every member of an ordinal is an ordinal. So let a E ao. Then a ¢ A, which implies a E To or a = To or To E a. From either of the last two assertions we can infer that To E ao, which is impossible. So we get a E To, hence ao Ç To. In the same way we conclude successively from a E To that a B, a E ao, and To C ao. Altogether we have shown that ao = To.
From the results in Section 1.3 we can easily infer that this is a proper class. If a E ON and w is the set of natural numbers defined below, then we can define a function (an: n E w) by ao:= a and an+i:= an + 1; the ordinal r:= sup{an: n E w} is a limit ordinal greater than a.
We cannot prove this assertion without the axiom of regularity.
The sets [a]?, [a],chwr(133) are defined analogously in Section 1.6.
Then we have two different definitions of an ordered pair, since the set (c, d) is not equal to the function {(0, c), (1, d)}.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Basel AG
About this chapter
Cite this chapter
Holz, M., Steffens, K., Weitz, E. (1999). Foundations. In: Introduction to Cardinal Arithmetic. Modern Birkhäuser Classics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0346-0330-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-0346-0330-0_2
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0346-0327-0
Online ISBN: 978-3-0346-0330-0
eBook Packages: Springer Book Archive