Naive Set Theory by Halmos
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
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 -
Set (Mathematics) from Wikipedia, the Free Encyclopedia
Set (mathematics) From Wikipedia, the free encyclopedia A set in mathematics is a collection of well defined and distinct objects, considered as an object in its own right. Sets are one of the most fundamental concepts in mathematics. Developed at the end of the 19th century, set theory is now a ubiquitous part of mathematics, and can be used as a foundation from which nearly all of mathematics can be derived. In mathematics education, elementary topics such as Venn diagrams are taught at a young age, while more advanced concepts are taught as part of a university degree. Contents The intersection of two sets is made up of the objects contained in 1 Definition both sets, shown in a Venn 2 Describing sets diagram. 3 Membership 3.1 Subsets 3.2 Power sets 4 Cardinality 5 Special sets 6 Basic operations 6.1 Unions 6.2 Intersections 6.3 Complements 6.4 Cartesian product 7 Applications 8 Axiomatic set theory 9 Principle of inclusion and exclusion 10 See also 11 Notes 12 References 13 External links Definition A set is a well defined collection of objects. Georg Cantor, the founder of set theory, gave the following definition of a set at the beginning of his Beiträge zur Begründung der transfiniten Mengenlehre:[1] A set is a gathering together into a whole of definite, distinct objects of our perception [Anschauung] and of our thought – which are called elements of the set. The elements or members of a set can be anything: numbers, people, letters of the alphabet, other sets, and so on. -
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 . -
Mechanizing Set Theory: Cardinal Arithmetic and the Axiom Of
Mechanizing Set Theory Cardinal Arithmetic and the Axiom of Choice Lawrence C. Paulson Computer Laboratory, University of Cambridge email: [email protected] Krzysztof Grabczewski Nicholas Copernicus University, Torun,´ Poland email: [email protected] January 1996 Minor revisions, November 2000 Abstract. Fairly deep results of Zermelo-Frænkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is = , where is any infinite cardinal. Proving this result required developing theories of orders, order-isomorphisms, order types, ordinal arithmetic, cardinals, etc.; this covers most of Kunen, Set Theory, Chapter I. Further- more, we have proved the equivalence of 7 formulations of the Well-ordering Theorem and 20 formulations of AC; this covers the first two chapters of Rubin and Rubin, Equivalents of the Axiom of Choice, and involves highly technical material. The definitions used in the proofs are largely faithful in style to the original mathematics. Key words: Isabelle, cardinal arithmetic, Axiom of Choice, set theory, QED project Contents 1 Introduction 1 2 Isabelle and ZF Set Theory 2 3 The Cardinal Proofs: Motivation and Discussion 3 3.1 Infinite Branching Trees 3 3.2 Overview of Kunen, Chapter I 5 4 Foundations of Cardinal Arithmetic 7 4.1 Well-orderings 7 4.2 Order Types 8 4.3 Combining Well-orderings 8 4.4 Cardinal Numbers 9 4.5 Cardinal Arithmetic 10 5 Proving = 10 5.1 Kunen’s Proof 10 5.2 Mechanizing the Proof 12 6 The Axiom of Choice and the Well-Ordering Theorem 15 7 Rubin and Rubin’s AC Proofs 17 7.1 The Well-Ordering Theorem 17 7.2 The Axiom of Choice 18 7.3 Difficulties with the Definitions 20 7.4 General Comments on the Proofs 21 7.5 Consolidating Some Proofs 22 7.6 The Axiom of Dependent Choice 24 8 Proving WO6 =⇒ WO1 24 8.1 The idea of the proof 25 8.2 Preliminaries to the Mechanization 26 8.3 Mechanizing the Proof 27 9 Conclusions 30 2 Lawrence C. -
Normalized Naive Set Theory
Normalized Naive Set Theory Erik Istre Abstract The broad goal of this thesis is the realization of a mathematically useful formal theory that contains a truth predicate, or as it's called in the literature, a \naive theory". To realize this goal, we explore the prospects for a naive set theory which can define a truth predicate. We first consider some of the promising developments in naive set theories using various non-classical logics that have come before. We look at two classes of non-classical logics: weak relevant logics [58, 59] and light linear logics [52]. Both of these have been used in the development of naive set theories. We review the naive set theories using these logics then discuss the strengths and weaknesses of these approaches. We then turn to the primary contribution of this thesis: the development of a robust naive set theory by accepting only normalized proofs, an idea first proposed by logician Dag Prawitz [25, 39]. It is demonstrated that this theory meets our need of logical strength in a system, while possessing more expressiveness in a foundational system than has come before. All of Heyting Arithmetic is recovered in this theory using a type-theoretic translation of the proof theory and other unique features of the theory are discussed and explored. It is further asserted that this theory is in fact the best case scenario for realizing informal proof in a formal system. 1 Contents 0 Preliminaries 5 1 Why Naive Set Theory? 8 1.1 Why naivety? . .9 1.2 How to be naive? . -
Chapter I the Basics of Set Theory
Chapter I The Basics of Set Theory 1. Introduction Every mathematician needs a working knowledge of set theory. The purpose of this chapter is to provide some of the basic information. Some additional set theory will be discussed in Chapter VIII. Sets are a useful vocabulary in many areas of mathematics. They provide a language for stating interesting results. For example, in analysis: “a monotone function from ‘‘ to is continuous except, at most, on a countable set of points.” In fact, set theory had its origins in analysis, with work done in the late 19th century by Georg Cantor (1845-1918) on Fourier series. This work played an important role in the development of topology, and all the basics of the subject are cast in the language of set theory. However sets are not just a tool; like many other mathematical ideas, “set theory” has grown into a fruitful research area of its own. Moreover, on the philosophical side, most mathematicians accept set theory as a foundation for mathematics that is, the notions of “set” and “membership in a set” can be taken as the most primitive notions of mathematics, in terms of which all (or nearly all) others can be defined. From this point of view, “everything in mathematics is a set.” To put it another way, most mathematicians believe that “mathematics can be embedded in set theory.” So, you ask, what is a set? There are several different ways to try to answer. Intuitively and this is good enough for most of our work in this course a set is a collection of objects, called its elements or members. -
Rieger, A. Paradox, ZF, and the Axiom of Foundation. in Clark, P. and Hallett, M
Rieger, A. Paradox, ZF, and the axiom of foundation. In Clark, P. and Hallett, M. and DeVidi, D. (Eds) Vintage Enthusiasms: Essays in Honour of J. L. Bell. (2008). http://eprints.gla.ac.uk/3810/ Deposited on: 8 November 2007 Glasgow ePrints Service http://eprints.gla.ac.uk Paradox, ZF, and the Axiom of Foundation∗ Adam Rieger It is a great pleasure to contribute to this Festschrift for John Bell. No-one has done more than he has to demonstrate the fruitfulness of the interplay between technical mathematics and philosophical issues, and he is an inspira- tion to all of us who work somewhere in the borderland between mathematics and philosophy. I also owe him a great personal debt. I arrived at the LSE dejected and disillusioned by my experiences of the Mathematical Tripos at Cambridge, but it is impossible to be downhearted for long in the company of John. His enthusiasm, humour and warmth were the perfect antidote to the stuffiness and inhumanity of Cambridge and helped hugely to rebuild my interest and self-confidence. John’s energy levels must be seen to be believed, and an evening with him is an unforgettable experience. It generally starts about 4 p.m. and ends around 5 in the morning, when the last of his companions (never John, who always gives the impression that he could go on talking indefinitely) finally succumbs to sleep. At John’s suggestion, I wrote my M.Sc. dissertation at the L.S.E. on truth, which led on eventually to an Oxford D.Phil. which concerned both the semantic and set-theoretical paradoxes. -
Notes on the Zermelo-Fraenkel Axioms for Set Theory
Math 220 Axioms for set theory November 14, 2003 Notes on the Zermelo-Fraenkel axioms for set theory Russell's paradox shows that one cannot talk about \the set of all sets" with- out running into a contradiction. In order to have a self-consistent language for talking about sets, one needs some rules that say what sets exist and what sentences are legitimate descriptions of sets. The most commonly used system of axioms for set theory is called \ZFC" in honor of Ernst Friedrich Ferdinand Zermelo (1871{1953) and Adolf Abra- ham Halevi Fraenkel (1891{1965). (The letter \C" refers to the Axiom of Choice discussed below.) Although there is no universal agreement on the order of the axioms, the exact wording of the axioms, or even how many axioms there are, most mathematicians will accept the following list. 1 Axiom of extension Two sets are equal if and only if they have the same elements: in symbols, 8A 8B ((A = B) () 8 x ((x 2 A) () ( x 2 B ))): Although Axiom 1 describes when two sets are equal, the axiom does not guarantee that any sets exist: conceivably the whole theory could be vacuous. The next axiom ¯lls this vacuum by stating that at least one set does exist. 2 Axiom of the empty set There exists a set with no elements: in symbols, 9A 8x (x=2A): By Axiom 1, the empty set (denoted ?) is unique! The next three axioms describe ways to build new sets from existing ones. 3 Axiom of unordered pairs Sets fx; yg exist: in symbols, 8x 8y 9A 8z ((z 2 A) () ((z = x) _ (z = y))): Axiom 3 also implies the existence of singleton sets: the set fxg is equal to the unordered pair fx; xg. -
An Approach to Basic Set Theory and Logic 11
AN APPROACH TO BASIC SET THEORY AND LOGIC JERZY DYDAK May 16, 2013 Abstract. The purpose of this paper is to outline a simple set of axioms for basic set theory from which most fundamental facts can be derived. The key to the whole project is a new axiom of set theory which I dubbed ‘The Law of Extremes’. It allows for quick proofs of basic set-theoretic identities and logical tautologies, so it is also a good tool to aid one’s memory. I do not assume any exposure to euclidean geometry via axioms. Only an experience with transforming algebraic identities is required. The idea is to get students to do proofs right from the get-go. In particular, I avoid entangling students in nuances of logic early on. Basic facts of logic are derived from set theory, not the other way around. 1. Introduction There is a widespread perception that students entering universities these days lack mathematical reasoning. As a result they are rushed through Introduction to Abstract Mathematics courses in the hope they can catch up and take serious math courses as juniors and seniors. My personal experience is that getting to that level requires longer time. I grew up in a system where rigorous Euclidean planar geometry was taught in the ninth grade, continued with stereometry in the tenth grade, and culminating with trigonometry in the eleventh grade. This was in addition to having algebra every year, with scarcity of proofs in that subject. Logic began at the university level with a course in Foundations of Mathematics.