SET THEORY Andrea K. Dieterly a Thesis Submitted to the Graduate

Total Page:16

File Type:pdf, Size:1020Kb

SET THEORY Andrea K. Dieterly a Thesis Submitted to the Graduate SET THEORY Andrea K. Dieterly A Thesis Submitted to the Graduate College of Bowling Green State University in partial fulfillment of the requirements for the degree of MASTER OF ARTS August 2011 Committee: Warren Wm. McGovern, Advisor Juan Bes Rieuwert Blok i Abstract Warren Wm. McGovern, Advisor This manuscript was to show the equivalency of the Axiom of Choice, Zorn's Lemma and Zermelo's Well-Ordering Principle. Starting with a brief history of the development of set history, this work introduced the Axioms of Zermelo-Fraenkel, common applications of the axioms, and set theoretic descriptions of sets of numbers. The book, Introduction to Set Theory, by Karel Hrbacek and Thomas Jech was the primary resource with other sources providing additional background information. ii Acknowledgements I would like to thank Warren Wm. McGovern for his assistance and guidance while working and writing this thesis. I also want to thank Reiuwert Blok and Juan Bes for being on my committee. Thank you to Dan Shifflet and Nate Iverson for help with the typesetting program LATEX. A personal thank you to my husband, Don, for his love and support. iii Contents Contents . iii 1 Introduction 1 1.1 Naive Set Theory . 2 1.2 The Axiom of Choice . 4 1.3 Russell's Paradox . 5 2 Axioms of Zermelo-Fraenkel 7 2.1 First Order Logic . 7 2.2 The Axioms of Zermelo-Fraenkel . 8 2.3 The Recursive Theorem . 13 3 Development of Numbers 16 3.1 Natural Numbers and Integers . 16 3.2 Rational Numbers . 20 3.3 Real Numbers . 22 4 Cardinal Numbers 25 4.1 Cardinal Numbers . 25 4.2 Equivalence of Axioms . 32 Bibliography 34 1 Chapter 1 Introduction A set is an abstraction that is produced in the mind: the set of primary colors, the set of odd integers, or a set of dishes. When we talk about a collection, the mind grasps or pictures the elements together with some relationship between the objects. In a general sense, a set is a collection of objects. However as deduced in Russell's Paradox certain collections cannot be sets. Since we want to be able to define a set by either listing its objects or defining its members by some basic property, we are going to move beyond this basic idea. Axiomatic set theory is the art of explicitly expressing mathematics with rigid rules of logic and the property of membership in a set. We say that an object is a member of a set or an element of a set, denoted 2. This is the very essence of set theory along with logical expressions: \and" ... \or" ... \then" ... \if and only if" and quantifiers: \for all" and \there exists". Our intuition supplies concepts that we want to be included in the theory. Set equality, creation of new sets from existing sets, even the empty set need to be defined by or derived from our set of axioms. Many have worked and laid the foundations of set theory. Georg Cantor's ideas about infinity were radical in his time, but now are widely accepted. The axioms that we will focus on were developed by Ernst Zermelo in 1908 and additional contributions were made by Abraham Fraenkel in 1922. This collection of axioms is known as ZF. 2 1.1 Naive Set Theory We begin by naively recalling important sets which will be defined formally later. Our first set is the set of natural numbers f1,2,3,...g, the numbers that we recited back to parents and teachers, and learned to put in a one-to-one correspondence with objects. Somewhere in the learning process, debt entered the picture; we added negative values and introduced the set of integers f...,-3,-2,-1,0,1,2,3,...g. The question also arose, \what happens when we equally divide five pieces of bread among three people?" The answer leads to another set: an integer divided by an integer - the set of rational numbers. It was assumed that now every number had been defined, until somewhere around the time of Pythagoras when it was shown that the square root of two could not be written as a rational number but it was known to exist, so the set of irrational numbers was defined. With the union of the set of rational numbers with the set of irrational numbers, all numbers were defined on a number line, and the set of real numbers was first described. Hence we will call the real numbers: the continuum. Georg Cantor published a series of papers between 1873 and 1897 with goals of charac- terizing the sizes of infinite sets. He wrote about the distinctions between countable and uncountable sets of real numbers. He defined the power of the set as a size of its measure; he believed in the existence of infinite sets that shared characteristics with finite sets and transfinite numbers that act like ordinary counting numbers [Drake and D.Singh, 1996, p.1]. Cantor talked about the Absolute Infinite which he identified with God who is beyond mathematics. Today, the collection of all ordinals which is an example of von Neumann's proper classes, has been compared to the absolute infinite [Drake and D.Singh, 1996, p.2]. Cantor began his investigations by defining the cardinality of finite sets. If two finite sets have the same cardinality, then their elements can be put in a one-to-one correspondence with each other. He extended this idea to infinite sets as sets that can be put into a one- to-one correspondence to a proper subset of itself [Wapner, 2005, p.8]. For example, the set of even integers is a subset of the set of integers, but since a one-to-correspondence exists between them, they have the same cardinality. 3 Cantor is known for showing that the rational numbers have the same cardinality as the natural numbers with the method that has come to be called the Cantor diagonalization argument. In his argument he showed that the real numbers do not have the same cardinality as the natural numbers and even though his argument relies heavily on the Axiom of Choice, more recent proofs have been \choice-free". So Cantor established the existence of at least two infinities, the second which is the cardinality of the continuum. He hypothesized a hierarchy of infinities which gives us the notation that we use today: aleph nought { @0 representing the cardinality of natural numbers and 2@0 representing the cardinality of the continuum [Wapner, 2005, p.12]. What is now known as the Continuum Hypothesis, 2@0 = @1; was one of his obsessions that may have led to his mental breakdown at the end of his life [Dauben, 1993, Internet version 2004, p.1]. Cantor's early biographers portrayed him as suffering longer and longer periods of mental breakdowns due to the conflicts about his theories and the resistance they aroused from the mathematical community. Poincare declared the theory of transfinite numbers as a \disease" which hopefully math could recover. Kronecker attacked Cantor personally, calling him a \scientific charlatain" and a \corrupter of youth." It has come to light that Cantor was indeed suffering from cyclic manic-depression. It has been suggested that Cantor used the seasons of his illness to produce a great deal during the manic cycle and then during a following depression he was able to overcome his own doubts to the solidness of his theories [Dauben, 1993, Internet version 2004, p.1-2]. By the end of his life, Cantor's work was becoming accepted. Hilbert described his work as ... \the finest product of mathematical genius and and one of the supreme achievements of purely intellectual human activity" [O'Connor and Robertson, October 1998, p.1]. 4 1.2 The Axiom of Choice The Axiom of Choice is the workhorse of so many theorems; though unaware, Cantor em- ployed it in his diagonalization proof. But if mathematicians allow this axiom, then they must accept the startling conclusions. If S is a collection of non-empty sets, then a new set of elements, called a choice set, can be formed by choosing one element from each set in the collection. This does not seem like an unreasonable idea. Surely, if S is a finite collection, the existence of a choice set follows from a finite number of steps. We can actually construct the set. But if S is infinite, does a choice set exist? Sometimes yes and sometimes no. Bertrand Russell clarified this with his shoes and socks example: \to choose one sock from each of infinitely many pairs of socks requires the Axiom of Choice, but for shoes the axiom is not needed." We can create an explicit choice set for shoes with an algorithm such as always choose the right shoe and so the set is clearly defined. But an algorithm that would yield a clearly defined set is not available for choosing one sock from infinitely many pairs of socks. We need the Axiom of Choice to create a unique set, and we must assume its existence as an axiom [Wapner, 2005, p.16ff]. The Axiom of Choice has led to some very surprising conclusions. For example, the ability to reassemble a single sphere into two new spheres identical to the first (The Banach-Tarski Paradox) or the existence of a set of real numbers which is not Lebesgue measurable. These conclusions are why some mathematicians avoid this axiom. Others embrace it because it yields results that we could not get otherwise. David Hilbert listed the Continuum Hypothesis first on his list of twenty-three unsolved problems in 1900 at the congress in Paris.
Recommended publications
  • Set Theory, by Thomas Jech, Academic Press, New York, 1978, Xii + 621 Pp., '$53.00
    BOOK REVIEWS 775 BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 3, Number 1, July 1980 © 1980 American Mathematical Society 0002-9904/80/0000-0 319/$01.75 Set theory, by Thomas Jech, Academic Press, New York, 1978, xii + 621 pp., '$53.00. "General set theory is pretty trivial stuff really" (Halmos; see [H, p. vi]). At least, with the hindsight afforded by Cantor, Zermelo, and others, it is pretty trivial to do the following. First, write down a list of axioms about sets and membership, enunciating some "obviously true" set-theoretic principles; the most popular Hst today is called ZFC (the Zermelo-Fraenkel axioms with the axiom of Choice). Next, explain how, from ZFC, one may derive all of conventional mathematics, including the general theory of transfinite cardi­ nals and ordinals. This "trivial" part of set theory is well covered in standard texts, such as [E] or [H]. Jech's book is an introduction to the "nontrivial" part. Now, nontrivial set theory may be roughly divided into two general areas. The first area, classical set theory, is a direct outgrowth of Cantor's work. Cantor set down the basic properties of cardinal numbers. In particular, he showed that if K is a cardinal number, then 2", or exp(/c), is a cardinal strictly larger than K (if A is a set of size K, 2* is the cardinality of the family of all subsets of A). Now starting with a cardinal K, we may form larger cardinals exp(ic), exp2(ic) = exp(exp(fc)), exp3(ic) = exp(exp2(ic)), and in fact this may be continued through the transfinite to form expa(»c) for every ordinal number a.
    [Show full text]
  • 1 Elementary Set Theory
    1 Elementary Set Theory Notation: fg enclose a set. f1; 2; 3g = f3; 2; 2; 1; 3g because a set is not defined by order or multiplicity. f0; 2; 4;:::g = fxjx is an even natural numberg because two ways of writing a set are equivalent. ; is the empty set. x 2 A denotes x is an element of A. N = f0; 1; 2;:::g are the natural numbers. Z = f:::; −2; −1; 0; 1; 2;:::g are the integers. m Q = f n jm; n 2 Z and n 6= 0g are the rational numbers. R are the real numbers. Axiom 1.1. Axiom of Extensionality Let A; B be sets. If (8x)x 2 A iff x 2 B then A = B. Definition 1.1 (Subset). Let A; B be sets. Then A is a subset of B, written A ⊆ B iff (8x) if x 2 A then x 2 B. Theorem 1.1. If A ⊆ B and B ⊆ A then A = B. Proof. Let x be arbitrary. Because A ⊆ B if x 2 A then x 2 B Because B ⊆ A if x 2 B then x 2 A Hence, x 2 A iff x 2 B, thus A = B. Definition 1.2 (Union). Let A; B be sets. The Union A [ B of A and B is defined by x 2 A [ B if x 2 A or x 2 B. Theorem 1.2. A [ (B [ C) = (A [ B) [ C Proof. Let x be arbitrary. x 2 A [ (B [ C) iff x 2 A or x 2 B [ C iff x 2 A or (x 2 B or x 2 C) iff x 2 A or x 2 B or x 2 C iff (x 2 A or x 2 B) or x 2 C iff x 2 A [ B or x 2 C iff x 2 (A [ B) [ C Definition 1.3 (Intersection).
    [Show full text]
  • Mathematics 144 Set Theory Fall 2012 Version
    MATHEMATICS 144 SET THEORY FALL 2012 VERSION Table of Contents I. General considerations.……………………………………………………………………………………………………….1 1. Overview of the course…………………………………………………………………………………………………1 2. Historical background and motivation………………………………………………………….………………4 3. Selected problems………………………………………………………………………………………………………13 I I. Basic concepts. ………………………………………………………………………………………………………………….15 1. Topics from logic…………………………………………………………………………………………………………16 2. Notation and first steps………………………………………………………………………………………………26 3. Simple examples…………………………………………………………………………………………………………30 I I I. Constructions in set theory.………………………………………………………………………………..……….34 1. Boolean algebra operations.……………………………………………………………………………………….34 2. Ordered pairs and Cartesian products……………………………………………………………………… ….40 3. Larger constructions………………………………………………………………………………………………..….42 4. A convenient assumption………………………………………………………………………………………… ….45 I V. Relations and functions ……………………………………………………………………………………………….49 1.Binary relations………………………………………………………………………………………………………… ….49 2. Partial and linear orderings……………………………..………………………………………………… ………… 56 3. Functions…………………………………………………………………………………………………………… ….…….. 61 4. Composite and inverse function.…………………………………………………………………………… …….. 70 5. Constructions involving functions ………………………………………………………………………… ……… 77 6. Order types……………………………………………………………………………………………………… …………… 80 i V. Number systems and set theory …………………………………………………………………………………. 84 1. The Natural Numbers and Integers…………………………………………………………………………….83 2. Finite induction
    [Show full text]
  • Structural Reflection and the Ultimate L As the True, Noumenal Universe Of
    Scuola Normale Superiore di Pisa CLASSE DI LETTERE Corso di Perfezionamento in Filosofia PHD degree in Philosophy Structural Reflection and the Ultimate L as the true, noumenal universe of mathematics Candidato: Relatore: Emanuele Gambetta Prof.- Massimo Mugnai anno accademico 2015-2016 Structural Reflection and the Ultimate L as the true noumenal universe of mathematics Emanuele Gambetta Contents 1. Introduction 7 Chapter 1. The Dream of Completeness 19 0.1. Preliminaries to this chapter 19 1. G¨odel'stheorems 20 1.1. Prerequisites to this section 20 1.2. Preliminaries to this section 21 1.3. Brief introduction to unprovable truths that are mathematically interesting 22 1.4. Unprovable mathematical statements that are mathematically interesting 27 1.5. Notions of computability, Turing's universe and Intuitionism 32 1.6. G¨odel'ssentences undecidable within PA 45 2. Transfinite Progressions 54 2.1. Preliminaries to this section 54 2.2. Gottlob Frege's definite descriptions and completeness 55 2.3. Transfinite progressions 59 3. Set theory 65 3.1. Preliminaries to this section 65 3.2. Prerequisites: ZFC axioms, ordinal and cardinal numbers 67 3.3. Reduction of all systems of numbers to the notion of set 71 3.4. The first large cardinal numbers and the Constructible universe L 76 3.5. Descriptive set theory, the axioms of determinacy and Luzin's problem formulated in second-order arithmetic 84 3 4 CONTENTS 3.6. The method of forcing and Paul Cohen's independence proof 95 3.7. Forcing Axioms, BPFA assumed as a phenomenal solution to the continuum hypothesis and a Kantian metaphysical distinction 103 3.8.
    [Show full text]
  • A Cardinal Sin: the Infinite in Spinoza's Philosophy
    Macalester College DigitalCommons@Macalester College Philosophy Honors Projects Philosophy Department Spring 2014 A Cardinal Sin: The nfinitI e in Spinoza's Philosophy Samuel H. Eklund Macalester College, [email protected] Follow this and additional works at: http://digitalcommons.macalester.edu/phil_honors Part of the Philosophy Commons Recommended Citation Eklund, Samuel H., "A Cardinal Sin: The nfinitI e in Spinoza's Philosophy" (2014). Philosophy Honors Projects. Paper 7. http://digitalcommons.macalester.edu/phil_honors/7 This Honors Project is brought to you for free and open access by the Philosophy Department at DigitalCommons@Macalester College. It has been accepted for inclusion in Philosophy Honors Projects by an authorized administrator of DigitalCommons@Macalester College. For more information, please contact [email protected]. A Cardinal Sin: The Infinite in Spinoza’s Philosophy By: Samuel Eklund Macalester College Philosophy Department Honors Advisor: Geoffrey Gorham Acknowledgements This thesis would not have been possible without my advisor, Professor Geoffrey Gorham. Through a collaborative summer research grant, I was able to work with him in improving a vague idea about writing on Spinoza’s views on existence and time into a concrete analysis of Spinoza and infinity. Without his help during the summer and feedback during the past academic year, my views on Spinoza wouldn’t have been as developed as they currently are. Additionally, I would like to acknowledge the hard work done by the other two members of my honors committee: Professor Janet Folina and Professor Andrew Beveridge. Their questions during the oral defense and written feedback were incredibly helpful in producing the final draft of this project.
    [Show full text]
  • On the Infinite in Leibniz's Philosophy
    On the Infinite in Leibniz's Philosophy Elad Lison Interdisciplinary Studies Unit Science, Technology and Society Ph.D. Thesis Submitted to the Senate of Bar-Ilan University Ramat-Gan, Israel August 2010 This work was carried out under the supervision of Dr. Ohad Nachtomy (Department of Philosophy), Bar-Ilan University. Contents א.……………………………….…………………………………………Hebrew Abstract Prologue…………………………………………………………...………………………1 Part A: Historic Survey Methodological Introduction…………………………………………………………..15 1. Aristotle: Potential Infinite………………………………………………………….16 2. Thomas Aquinas: God and the Infinite………………………………………..…….27 3. William of Ockham: Syncategorematic and Actual Infinite……………………..….32 4. Rabbi Abraham Cohen Herrera: Between Absolute Unity and Unbounded Multitude………………………………………………………………………..….42 5. Galileo Galilei: Continuum Constructed from Infinite Zero's………………………49 6. René Descartes: Infinite as Indefinite…………………………………………….…58 7. Pierre Gassendi: Rejection of the Infinite…………………………………………...69 8. Baruch Spinoza: Infinite Unity…………………………………………………...…73 9. General Background: Leibniz and the History of the Infinite……………………....81 Summary…………………………………………………………………………….…94 Part B: Mathematics Introduction…………………………………………………………………………….99 1. 'De Arte Combinatoria' as a Formal Basis for Thought: Retrospective on Leibniz's 1666 Dissertation………………………………………………………………....102 2. Leibniz and the Infinitesimal Calculus……………………………………….……111 2.1. Mathematical Background: Mathematical Works in 16th-17th Centuries…..111 2.2. Leibniz's Mathematical Development…………………………………….…127
    [Show full text]
  • A Taste of Set Theory for Philosophers
    Journal of the Indian Council of Philosophical Research, Vol. XXVII, No. 2. A Special Issue on "Logic and Philosophy Today", 143-163, 2010. Reprinted in "Logic and Philosophy Today" (edited by A. Gupta ans J.v.Benthem), College Publications vol 29, 141-162, 2011. A taste of set theory for philosophers Jouko Va¨an¨ anen¨ ∗ Department of Mathematics and Statistics University of Helsinki and Institute for Logic, Language and Computation University of Amsterdam November 17, 2010 Contents 1 Introduction 1 2 Elementary set theory 2 3 Cardinal and ordinal numbers 3 3.1 Equipollence . 4 3.2 Countable sets . 6 3.3 Ordinals . 7 3.4 Cardinals . 8 4 Axiomatic set theory 9 5 Axiom of Choice 12 6 Independence results 13 7 Some recent work 14 7.1 Descriptive Set Theory . 14 7.2 Non well-founded set theory . 14 7.3 Constructive set theory . 15 8 Historical Remarks and Further Reading 15 ∗Research partially supported by grant 40734 of the Academy of Finland and by the EUROCORES LogICCC LINT programme. I Journal of the Indian Council of Philosophical Research, Vol. XXVII, No. 2. A Special Issue on "Logic and Philosophy Today", 143-163, 2010. Reprinted in "Logic and Philosophy Today" (edited by A. Gupta ans J.v.Benthem), College Publications vol 29, 141-162, 2011. 1 Introduction Originally set theory was a theory of infinity, an attempt to understand infinity in ex- act terms. Later it became a universal language for mathematics and an attempt to give a foundation for all of mathematics, and thereby to all sciences that are based on mathematics.
    [Show full text]
  • The Axiom of Infinity and the Natural Numbers
    Axiom of Infinity Natural Numbers Axiomatic Systems The Axiom of Infinity and The Natural Numbers Bernd Schroder¨ logo1 Bernd Schroder¨ Louisiana Tech University, College of Engineering and Science The Axiom of Infinity and The Natural Numbers 1. The axioms that we have introduced so far provide for a rich theory. 2. But they do not guarantee the existence of infinite sets. 3. In fact, the superstructure over the empty set is a model that satisfies all the axioms so far and which does not contain any infinite sets. (Remember that the superstructure itself is not a set in the model.) Axiom of Infinity Natural Numbers Axiomatic Systems Infinite Sets logo1 Bernd Schroder¨ Louisiana Tech University, College of Engineering and Science The Axiom of Infinity and The Natural Numbers 2. But they do not guarantee the existence of infinite sets. 3. In fact, the superstructure over the empty set is a model that satisfies all the axioms so far and which does not contain any infinite sets. (Remember that the superstructure itself is not a set in the model.) Axiom of Infinity Natural Numbers Axiomatic Systems Infinite Sets 1. The axioms that we have introduced so far provide for a rich theory. logo1 Bernd Schroder¨ Louisiana Tech University, College of Engineering and Science The Axiom of Infinity and The Natural Numbers 3. In fact, the superstructure over the empty set is a model that satisfies all the axioms so far and which does not contain any infinite sets. (Remember that the superstructure itself is not a set in the model.) Axiom of Infinity Natural Numbers Axiomatic Systems Infinite Sets 1.
    [Show full text]
  • Automated ZFC Theorem Proving with E
    Automated ZFC Theorem Proving with E John Hester Department of Mathematics, University of Florida, Gainesville, Florida, USA https://people.clas.ufl.edu/hesterj/ [email protected] Abstract. I introduce an approach for automated reasoning in first or- der set theories that are not finitely axiomatizable, such as ZFC, and describe its implementation alongside the automated theorem proving software E. I then compare the results of proof search in the class based set theory NBG with those of ZFC. Keywords: ZFC · ATP · E. 1 Introduction Historically, automated reasoning in first order set theories has faced a fun- damental problem in the axiomatizations. Some theories such as ZFC widely considered as candidates for the foundations of mathematics are not finitely axiomatizable. Axiom schemas such as the schema of comprehension and the schema of replacement in ZFC are infinite, and so cannot be entirely incorpo- rated in to the prover at the beginning of a proof search. Indeed, there is no finite axiomatization of ZFC [1]. As a result, when reasoning about sufficiently strong set theories that could no longer be considered naive, some have taken the alternative approach of using extensions of ZFC that admit objects such as proper classes as first order objects, but this is not without its problems for the individual interested in proving set-theoretic propositions. As an alternative, I have programmed an extension to the automated the- orem prover E [2] that generates instances of parameter free replacement and comprehension from well formuled formulas of ZFC that are passed to it, when eligible, and adds them to the proof state while the prover is running.
    [Show full text]
  • 17 Axiom of Choice
    Math 361 Axiom of Choice 17 Axiom of Choice De¯nition 17.1. Let be a nonempty set of nonempty sets. Then a choice function for is a function f sucFh that f(S) S for all S . F 2 2 F Example 17.2. Let = (N)r . Then we can de¯ne a choice function f by F P f;g f(S) = the least element of S: Example 17.3. Let = (Z)r . Then we can de¯ne a choice function f by F P f;g f(S) = ²n where n = min z z S and, if n = 0, ² = min z= z z = n; z S . fj j j 2 g 6 f j j j j j 2 g Example 17.4. Let = (Q)r . Then we can de¯ne a choice function f as follows. F P f;g Let g : Q N be an injection. Then ! f(S) = q where g(q) = min g(r) r S . f j 2 g Example 17.5. Let = (R)r . Then it is impossible to explicitly de¯ne a choice function for . F P f;g F Axiom 17.6 (Axiom of Choice (AC)). For every set of nonempty sets, there exists a function f such that f(S) S for all S . F 2 2 F We say that f is a choice function for . F Theorem 17.7 (AC). If A; B are non-empty sets, then the following are equivalent: (a) A B ¹ (b) There exists a surjection g : B A. ! Proof. (a) (b) Suppose that A B.
    [Show full text]
  • Elements of Set Theory
    Elements of set theory April 1, 2014 ii Contents 1 Zermelo{Fraenkel axiomatization 1 1.1 Historical context . 1 1.2 The language of the theory . 3 1.3 The most basic axioms . 4 1.4 Axiom of Infinity . 4 1.5 Axiom schema of Comprehension . 5 1.6 Functions . 6 1.7 Axiom of Choice . 7 1.8 Axiom schema of Replacement . 9 1.9 Axiom of Regularity . 9 2 Basic notions 11 2.1 Transitive sets . 11 2.2 Von Neumann's natural numbers . 11 2.3 Finite and infinite sets . 15 2.4 Cardinality . 17 2.5 Countable and uncountable sets . 19 3 Ordinals 21 3.1 Basic definitions . 21 3.2 Transfinite induction and recursion . 25 3.3 Applications with choice . 26 3.4 Applications without choice . 29 3.5 Cardinal numbers . 31 4 Descriptive set theory 35 4.1 Rational and real numbers . 35 4.2 Topological spaces . 37 4.3 Polish spaces . 39 4.4 Borel sets . 43 4.5 Analytic sets . 46 4.6 Lebesgue's mistake . 48 iii iv CONTENTS 5 Formal logic 51 5.1 Propositional logic . 51 5.1.1 Propositional logic: syntax . 51 5.1.2 Propositional logic: semantics . 52 5.1.3 Propositional logic: completeness . 53 5.2 First order logic . 56 5.2.1 First order logic: syntax . 56 5.2.2 First order logic: semantics . 59 5.2.3 Completeness theorem . 60 6 Model theory 67 6.1 Basic notions . 67 6.2 Ultraproducts and nonstandard analysis . 68 6.3 Quantifier elimination and the real closed fields .
    [Show full text]
  • The Z of ZF and ZFC and ZF¬C
    From SIAM News , Volume 41, Number 1, January/February 2008 The Z of ZF and ZFC and ZF ¬C Ernst Zermelo: An Approach to His Life and Work. By Heinz-Dieter Ebbinghaus, Springer, New York, 2007, 356 pages, $64.95. The Z, of course, is Ernst Zermelo (1871–1953). The F, in case you had forgotten, is Abraham Fraenkel (1891–1965), and the C is the notorious Axiom of Choice. The book under review, by a prominent logician at the University of Freiburg, is a splendid in-depth biography of a complex man, a treatment that shies away neither from personal details nor from the mathematical details of Zermelo’s creations. BOOK R EV IEW Zermelo was a Berliner whose early scientific work was in applied By Philip J. Davis mathematics: His PhD thesis (1894) was in the calculus of variations. He had thought about this topic for at least ten additional years when, in 1904, in collaboration with Hans Hahn, he wrote an article on the subject for the famous Enzyclopedia der Mathematische Wissenschaften . In point of fact, though he is remembered today primarily for his axiomatization of set theory, he never really gave up applications. In his Habilitation thesis (1899), Zermelo was arguing with Ludwig Boltzmann about the foun - dations of the kinetic theory of heat. Around 1929, he was working on the problem of the path of an airplane going in minimal time from A to B at constant speed but against a distribution of winds. This was a problem that engaged Levi-Civita, von Mises, Carathéodory, Philipp Frank, and even more recent investigators.
    [Show full text]