Axiomatic Set Theory (Dover Books on Mathematics) [Paperback]

Patrick Suppes (Author)

Book Description

Publication Date: June 1, 1972 | ISBN-10: 0486616304 | ISBN-13: 978-0486616308

This clear and well-developed approach to axiomatic set theory is geared toward upper-level undergraduates and graduate students. It examines the basic paradoxes and history of set theory and advanced topics such as relations and functions, equipollence, finite sets and cardinal numbers, rational and real numbers, and other subjects. 1960 edition.

Product Details

• Paperback: 288 pages
• Publisher: Dover Publications (June 1, 1972)
• Language: English
• ISBN-10: 0486616304
• ISBN-13: 978-0486616308
• Product Dimensions: 8.4 x 5.4 x 0.6 inches
• Shipping Weight: 10.4 ounces (View shipping rates and policies)
• Average Customer Review: 3.7 out of 5 stars  See all reviews (10 customer reviews)
• Amazon Best Sellers Rank: #161,207 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

37 of 37 people found the following review helpful:

5.0 out of 5 stars A classic exposition of ZFC, February 24, 2005

By 

galloamericanus "galloamericanus" (Podunk, Iowa) - See all my reviews

This review is from: Axiomatic Set Theory (Dover Books on Mathematics) (Paperback)

Mathematics is a first order theory whose primitive formulae

all take the form 'a is a member of b'. 'a' can be a set or atom; 'b' must be a set. If you do not object to the preceding sentence, then read on.

Axiomatic Set Theory (AST) lays down the axioms of the now-canonical set theory due to Zermelo, Fraenkel (and Skolem), called ZFC. Building on ZFC, Suppes then derives the theory of cardinal and ordinal numbers, the integers, rationals, and reals, and the transfinite--Cantor's paradise. Suppes accomplishes in 250 well laid out pages what required 800 crabbed pages in Principia Mathematica.

This book evolved out of a class Suppes taught at Stanford in the long ago 1950s. It has since remained the best book of its kind. The reason is that subsequent presentations of set theory are too difficult, too contrived, too clever by half. They disdain the basics as old hat.

AST has several valuable pedagogical features.

1. The introduction to relations and functions is the best I know of. I am disappointed at how little attention has been devoted to relations and relational algebra in recent decades.

2. Suppes has a nice way of introducing a simple axiom, then showing that that axiom is a theorem when a more complicated axiom is later introduced. In particular, he develops the theory of cardinals by means of a temporary axiom to the effect that equipollent sets have identical cardinalities. This axiom becomes a theorem when the axiom of Choice is introduced in the final chapter.

The axiom schema of Replacement is introduced as late as possible, to enable transfinite arithmetic. He then turns around and shows that Replacement makes Subsets and Pairing redundant.

In my opinion, the greatest flaw of ZFC is that defining a cardinal number requires either the axiom of Choice, or Infinity plus the subtle notion of set rank. Frege and Russell had an appealing definition: a cardinal number is an equivalence class of sets under equipollence. That definition does not work in ZFC. It does work in Quinian set theory. Suppes does a yeoman's job of battling this flaw.

3. Suppes defines a finite set in the interesting way Tarski proposed in 1924.

AST contains hundreds and hundreds of theorems, man of them useful classics. In many cases, the proof is an exercise. Suppes's proof are of the informal sort typical of mathematics. What AST does can be done more rigorously: type 'Metamath' into Google and see for yourself.

Even though Suppes is a philosopher, this book is almost entirely a mathematical exercise. The reader will not get a good feel for how set theory is part of analytic philosophy, and how it has been a contentious subject. The writings of Fraenkel and Bar Hillel are better in these respects. Suppes does highlight the reservations re the axiom of Choice, but Cohen's proof that Choice is independent of ZF has largely laid those reservations to rest, except for those of us with constructive sympathies. AST gives no hint that Replacement and Power Set give us far more set theory than is needed in practice. Thanks to the work of Aczel and Barwise, published around 1990, we have a better idea of what it means to dispense with Regularity. Shortly after the 1960 publication of AST, Lawvere and others began to lay down the category theoretic foundation of mathematics knowns as topos theory. That theory puts ZFC in a new light. Personally, I am astonished that an axiomatization of finite sets simpler than ZF has yet to emerge.

24 of 25 people found the following review helpful:

4.0 out of 5 stars An Excellent Text for Self-Study, November 27, 2000

By 

Matthew H. Phillips (Jersey City, NJ USA) - See all my reviews
(REAL NAME)   

This review is from: Axiomatic Set Theory (Dover Books on Mathematics) (Paperback)

This book presents a rigorous, axiomatic development of classic set theory, introducing the axioms as needed and founding nearly all results upon theorems derived earlier in the book (or on the axioms themselves). It is genuinely gratifying to see the development proceed in such a regimented fashion, from basic sets to natural numbers to reals, and then on to transfinite induction and the axiom of choice. There are numerous exercises; no answers are provided, but the intelligent reader who proceeds carefully should not find this a hindrance. It is however, not a modern book; readers who want to understand current ideasin set theory (inaccessible, supercompact cardinals, etc.) should look elsewhere.

35 of 39 people found the following review helpful:

4.0 out of 5 stars Still interesting...and still important., December 7, 2003

By 

Dr. Lee D. Carlson (Baltimore, Maryland USA) - See all my reviews
(VINE VOICE)    (HALL OF FAME REVIEWER)    (REAL NAME)   

This review is from: Axiomatic Set Theory (Dover Books on Mathematics) (Paperback)

One does not hear about set theory too much these days, no doubt due to the de-emphasis of foundational discussions in mathematics. Foundational questions of course were the focus of much attention in mathematics in the early twentieth century, this taking place because of the many paradoxes in set theory and due to the influence of the philosophers. Set theory, the theory of types, and mathematical logic are still very important though in computer science and in artificial intelligence, due to the needs in these fields for knowledge representation, computational models of intelligence, and automated reasoning. This book could serve to introduce these topics or as an historical reference to the issues as they were hotly debated in the last century.

The first chapter gives an informal introduction to the notion of a set, first-order predicate logic (notions of bound and free variables and quantification), and the Zermelo-Fraenkel axioms of set theory. The author describes the difficulties in the "axiom of abstraction" in the writings of Frege as pointed out by Bertrand Russell. It is pointed out that the axiom of abstraction is in fact an infinite collection of axioms, thus motivating the concept of an "axiom schema". The axiom schema that is used explicitly in the book is the "axiom schema of separation" due to Ernst Zermelo, which he formulated in order to make precise the notion of a statement as being "definite". More of the set-theoretic paradoxes are discussed, along with their classification due to F.P. Ramsey into "linguistic" and "semantical" ones.

The advantage of an older book on set theory is that more of the underlying details are explained, instead of just being formally developed. The author gives a thorough discussion of the concepts throughout the book, beginning with an organized development in chapter 2. He begins immediately with discussing the distinction between the object language and metalanguage, and the symbols to be used in the object language: constants, variables, logical connectives, quantifiers, and grouping symbols. These symbols are used to construct formulas, a subclass of which, the primitive formulas, are defined recursively, and which all formulas in the object language can be expressed in terms of. Throughout the book though the author uses additional notation that allows formulas not to be written in terms of primitive formulas. This is done to make the text more readable, but he requires that the added notion satisfy the criterion of eliminability and non-creativity. The notion of a set is defined formally, and then the axiom of extensionality, which gives a criterion for two sets being equal, and the axiom schema schema of separation. The pairing axiom, which gives the existence of a non-empty set; the sum axiom, which gives the existence of the union of a family of sets; the power set axiom, which gives the notion of the set of all subsets of a set; and the axiom of regularity, which prohibits infinite descending sequences of sets, are all discussed in detail.

Chapter 3 treats relations and functions, so important not only in mathematics but in computer science, especially in the theory of relational databases. Then in chapter 4, the author begins a study of cardinality and the cardinal numbers, proving that the finite cardinal numbers have the properties of the natural numbers, as one would expect. The author is careful to point out the need for the axiom of cardinal numbers in this study. Chapter 5 then goes into the theory of ordinal numbers, wherein it is emphasized that no special axioms are needed for the development of this theory. The author is also careful to note the special problems that arise in defining the arithmetic of natural numbers, such as defining addition recursively without using set theory. But including the apparatus of set theory does allow the replacement of the recursive definition by a proper definition. The axiom of infinity is brought in to permit the construction of arithmetical operations as certain sets. The theory of denumerable sets is then discussed, followed by one of the most fascinating concepts in all of mathematics: the theory of transfinite and infinite cardinals.

The author then shows that set theory can allow the construction of the real numbers, which takes place after the construction of the rational numbers. The famous "Dedekind cut" is discussed, along with the method of Cantor, which defines real numbers as equivalence classes of Cauchy sequences of rational numbers. The author uses the Cantor approach in the rest of the book. He also proves the famous Cantor theorem on the non-denumerability of the real numbers, and gives a brief discussion of the Continuum Hypothesis.

Chapter 8 then gives an overview of the fascinating topics of transfinite induction and ordinal number theory. Recursion theory makes its appearance again in the transfinite recursion for ordinal numbers, using the axiom schema of replacement. The non-commutativity of ordinal addition and multiplication is brought out, and the falsity of Fermat's Last Theorem and Goldbach's Hypothesis in ordinal number theory is shown. The author then shows to what extent cardinal number theory can be done without using special axioms by defining cardinal numbers as initial ordinals. The axiom of choice however is needed to show that every set has a cardinal number. The author then restates the Zermelo-Fraenkel axioms in their final form at the end of the chapter.

The final chapter gives an overview of the most controversial topic in all of set theory, if not in all of mathematics: the axiom of choice. The author shows that the use of this axiom allows one to prove that an infinite set has a denumerable subset, and he shows the equivalence of the axiom of choice with the numeration theorem, the well-ordering theorem, Zorn's lemma, and the law of trichotomy. The counterintuitive Banach-Tarski paradox is discussed, and the author shows the existence of axioms which imply the axiom of choice.