Set Theory History. Martin Bunder. September 2015
|
|
- Rodger Daniels
- 5 years ago
- Views:
Transcription
1 Set Theory History Martin Bunder September 2015
2 What is a set? Possible Definition A set is a collection of elements having a common property Abstraction Axiom If a(x) is a property ( y)( x)(x y a(x)) This says that for every property a(x) there is a set y that has all the elements that satisfy a(x). Notation: this y = {x a(x)} Comprehension Axiom (Cantor 1874, Frege (Begriffsschrift) 1879, 1903) ( z)(z {x a(x)}) a(z)
3 What is a set? Possible Definition A set is a collection of elements having a common property Abstraction Axiom If a(x) is a property ( y)( x)(x y a(x)) This says that for every property a(x) there is a set y that has all the elements that satisfy a(x). Notation: this y = {x a(x)} Comprehension Axiom (Cantor 1874, Frege (Begriffsschrift) 1879, 1903) ( z)(z {x a(x)}) a(z)
4 What is a set? Possible Definition A set is a collection of elements having a common property Abstraction Axiom If a(x) is a property ( y)( x)(x y a(x)) This says that for every property a(x) there is a set y that has all the elements that satisfy a(x). Notation: this y = {x a(x)} Comprehension Axiom (Cantor 1874, Frege (Begriffsschrift) 1879, 1903) ( z)(z {x a(x)}) a(z)
5 What is a set? Possible Definition A set is a collection of elements having a common property Abstraction Axiom If a(x) is a property ( y)( x)(x y a(x)) This says that for every property a(x) there is a set y that has all the elements that satisfy a(x). Notation: this y = {x a(x)} Comprehension Axiom (Cantor 1874, Frege (Begriffsschrift) 1879, 1903) ( z)(z {x a(x)}) a(z)
6 Examples of Sets {x x = a} = {a} {x x 2 = 1} = {1, 1} {x x = 1 x = 1} = {1, 1} {x x Z ( y)(y Z ( z)(z Z y = zx)} = {1, 1} x y {x x R 0 < x < 1} = (0, 1)
7 Extensionality Axiom A = B ( x)(x A x B) Sets are equal if they have the same elements. Assume if a(x) is a property of x: A = B (a(a) a(b))
8 Special Sets {x x x} = {x x R x 2 = 1} = {x x = x} = V {x x A x B} = A B {x x A x B} = A B {x x A} = A Empty Set Universal Set Union of A and B Intersection of A and B Complement of A
9 Subsets Definition A is a subset of B A B ( x)(x A x B) {x x A} = P(A)(the powerset of A) {x x } = { } {x x { } = {, { }} {x x {a, b, c}} = {, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}}
10 The Properties of Sets Come from Logic e.g. A B = B A Proof By the Comprehension Axiom: A B = {x x A x B} B A = {x x B x A} x A B x A x B x B x A by logic x B A So ( x)(x A B x B A). By the Extensionality Axiom A B = B A.
11 Similarly... A B = B A (A B) C = A (B C) A (B C) = (A B) C A (B C) = (A B) (A C) A (B C) = (A B) (A C) (A B) = A B (A B) = A B
12 Comparing Sets People Heads People Brains People Chairs Chickens Beaks Chickens Tails Definition Equivalent Sets are sets that have elements matched by a one to one mapping. A B ( f )f A B f is 1-1 and onto (a bijection) A is equivalent to B A B ( f )f A B f is 1-1 A B A B A B
13 Examples {+,, } {,, } {+,, } {,,, }
14 Defining Natural Numbers Note {+,, } {0, 1, 2} = 3. 0 = 1 = {0} = { } 2 = {0, 1} 3 = {0, 1, 2} etc. Definition If A n, n is the cardinal number of A, or n = #A. So, #{+,, } = 3.
15 Cardinal Arithmetic Definition Addition: If A B =, #A + #B = #(A B). e.g = #{0, 1, 2} + #{3, 4} = #{0, 1, 2, 3, 4} = 5. Definition Multiplication: #A #B = #(A B) where A B = {(a, b) a A, b B}. e.g. 3 2 = #{0, 1, 2} #{0, 1} = #({0, 1, 2} {0, 1}) = #{(0, 0), (0, 1), (1, 0), (1, 1), (2, 0), (2, 1)} = 6
16 Infinite Cardinal Numbers Let #{1, 2, 3, 4,... } = ℵ 0. If N = {1, 2, 3, 4,... }, E = {2, 4, 6, 8,... }. then if f (n) = 2n, f N E, f is 1-1 and onto. So N E and #E = ℵ 0. Also Q = {0, 1, 1, 1 2, 1 2, 2, 2, 1 3, 1 3, 2 3, 2 3, 3, 3,... }. So N Q and #Q = ℵ 0.
17 Some Arithmetic For n N: ℵ 0 + n = ℵ 0 nℵ 0 = ℵ 0 ℵ n 0 = ℵ 0 What about n ℵ 0? Is N [0, 1) R?
18 n ℵ 0 Assume N [0, 1). Then there is an f N [0, 1). f is 1-1 and onto So: f (1) =.a 11 a f (2) =.a 21 a f (3) =.a 31 a Let b =.b 1 b 2 b 3... a ii + 1 if a ii = 0 where b i = a ii 1 if a ii = 0 Then b f (n) for any n So N [0, 1) R #[0, 1) = #R = 2 ℵ 0. These must all be different (for 1-1) and use up all of [0, 1) (for onto)
19 Cantor #N = ℵ 0 is the smallest infinite cardinal number. ℵ 1 is the next smallest, then ℵ 2, etc. Continuum 2 ℵ 0 = ℵ 1 Hypothesis: Generalised Continuum Hypothesis: 2 ℵn = ℵ n+1 Georg Cantor ( ) Unresolved problem till 1964.
20 Cantor s Theorem A P(A) (Like the proof of N [0, 1)) Cantor s Paradox, 1899 So So V = {x x = x} P V P V But V P(V ) i.e. P(V ) V. Burali-Forti Paradox, 1897 Involves Ordinal Numbers.
21 Russel and Frege Bertrand Russell ( ) Gottlob Frege ( ) Russell sent his paradox to Frege when volume 2 of his Begriffsschrift was about to be published.
22 Russel s Paradox (1903) If R = {x x / x}, then by the Comprehension axiom: y {x a(x)} a(y) R R R / R A contradiction! (Gives: R R R R)
23 Hilbert at the 1900 International Congress of mathematics in Paris David Hilbert ( ) What would be the major problems of interest in mathematics in the 20th century? Hilbert listed 23: 1 The Continuum hypothesis, is 2 ℵ 0 = ℵ 1? 2 Prove that the axioms of arithmetic are consistent.
24 The Hilbert Programme Aim: To ground all existing theories (including set theory) to a finite, complete set of axioms, and prove that these are consistent.
25 Gödel s Incompleteness Theorems 1931 Kurt Gödel ( ) 1. In any axiomatic systems, strong enough to include arithmetic, there is always an arithmetical statement that can neither be proved nor disproved. 2. A statement saying such a system is consistent can neither be proved nor disproved.
26 Ways of Beating the Paradoxes: Change the Logic
27 Intuitionistic Logic Luitzen Brouwer ( ) Arend Heyting ( ) Don t allow P P, so you don t have V V V V or R R R R.
28 Paraconsistent Logic Newton da Costa (1929 -!) Allow R R and R R, but not P P Q. (This doesn t work, Curry s Paradox, IF C = {x x x X } then X.)
29 Logic and Aritmetic based on Combinatory Logic Moses Schonfinkel ( ) Haskell Curry ( )
30 Logic and Arithmetic based on Lambda Calculus Alonzo Church ( )
31 Ways of Beating the Paradoxes: Change the Set Theory
32 Change the Set Theory Ernst Zermelo ( ) Abraham Fraenkel ( )
33 Axioms ( z)(z x z y) x = y ( y)( x)(x y x z P(x)) ( z)(x z y z) ( z)( x)(x y y w x z) Extensionality Substitution of Specification (Defines subsets of z) Pairing (defines {x, y}) Union (z is the set of the elements of the elements of w.) + Others
34 von Neumann, Bernays and Gödel John von Neumann ( ) , 1928 Paul Bernays ( ) , 1945 Gödel Has sets and classes (only sets can be elements of classes.)
35 Axioms ( z)(z X z Y ) X = Y (X, Y classes) Extensionality ( Y )(x Y a(x)) (Y is a class) comprehension Only y X if y is a set + Axioms for sets
36 Continuum Hypothesis 2 ℵ 0 = ℵ 1 Can neither be proved or disproved in NBG or ZF! Paul Cohen ( )
37 Cardinal Numbers and Measures The measure, or length, of: [m, m + n] = n #[m, m + n] = 2 ℵ 0 #[0, a] = 2 ℵ 0 if a > 0 IF #A = ℵ 0, the measure A = 0 N { 1 10 n, 2 10 n+1, 3 10 n+2,... } k can be made arbitrarily small for n large 10n+k 1 Question:If #A = 2 ℵ 0 is a measure for A > 0?
This section will take the very naive point of view that a set is a collection of objects, the collection being regarded as a single object.
1.10. BASICS CONCEPTS OF SET THEORY 193 1.10 Basics Concepts of Set Theory Having learned some fundamental notions of logic, it is now a good place before proceeding to more interesting things, such as
More informationZermelo-Fraenkel Set Theory
Zermelo-Fraenkel Set Theory Zak Mesyan University of Colorado Colorado Springs The Real Numbers In the 19th century attempts to prove facts about the real numbers were limited by the lack of a rigorous
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationSet Theory and the Foundation of Mathematics. June 19, 2018
1 Set Theory and the Foundation of Mathematics June 19, 2018 Basics Numbers 2 We have: Relations (subsets on their domain) Ordered pairs: The ordered pair x, y is the set {{x, y}, {x}}. Cartesian products
More informationPart II Logic and Set Theory
Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationMAGIC Set theory. lecture 2
MAGIC Set theory lecture 2 David Asperó University of East Anglia 22 October 2014 Recall from last time: Syntactical vs. semantical logical consequence Given a set T of formulas and a formula ', we write
More informationINTRODUCTION TO CARDINAL NUMBERS
INTRODUCTION TO CARDINAL NUMBERS TOM CUCHTA 1. Introduction This paper was written as a final project for the 2013 Summer Session of Mathematical Logic 1 at Missouri S&T. We intend to present a short discussion
More informationINDEPENDENCE OF THE CONTINUUM HYPOTHESIS
INDEPENDENCE OF THE CONTINUUM HYPOTHESIS CAPSTONE MATT LUTHER 1 INDEPENDENCE OF THE CONTINUUM HYPOTHESIS 2 1. Introduction This paper will summarize many of the ideas from logic and set theory that are
More informationThe Legacy of Hilbert, Gödel, Gentzen and Turing
The Legacy of Hilbert, Gödel, Gentzen and Turing Amílcar Sernadas Departamento de Matemática - Instituto Superior Técnico Security and Quantum Information Group - Instituto de Telecomunicações TULisbon
More informationCantor (1). Georg Cantor ( ) studied in Zürich, Berlin, Göttingen Professor in Halle
Cantor (1). Georg Cantor (1845-1918) studied in Zürich, Berlin, Göttingen Professor in Halle Work in analysis leads to the notion of cardinality (1874): most real numbers are transcendental. Correspondence
More informationThe Search for the Perfect Language
The Search for the Perfect Language I'll tell you how the search for certainty led to incompleteness, uncomputability & randomness, and the unexpected result of the search for the perfect language. Bibliography
More informationVictoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY
Gödel s Proof Victoria Gitman and Thomas Johnstone New York City College of Technology, CUNY vgitman@nylogic.org http://websupport1.citytech.cuny.edu/faculty/vgitman tjohnstone@citytech.cuny.edu March
More informationSet Theory. p p (COMP) Manuel Bremer Centre for Logic, Language and Information
Set Theory Apart from semantic closure set theory is one of the main motivations for the strong paraconsistent approach. As well as we take convention (T) to be basic for truth so do we take the naive
More information(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M
1.3 Set Theory I As long as the terms of a mathematical theory are names of concrete objects as concrete as mothers breast, the very first object that received a name in human languages - there is not
More informationHilbert s problems, Gödel, and the limits of computation
Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University April 6, 2011 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert gave
More informationChapter 2 Axiomatic Set Theory
Chapter 2 Axiomatic Set Theory Ernst Zermelo (1871 1953) was the first to find an axiomatization of set theory, and it was later expanded by Abraham Fraenkel (1891 1965). 2.1 Zermelo Fraenkel Set Theory
More informationThe Reflection Theorem
The Reflection Theorem Formalizing Meta-Theoretic Reasoning Lawrence C. Paulson Computer Laboratory Lecture Overview Motivation for the Reflection Theorem Proving the Theorem in Isabelle Applying the Reflection
More informationGödel s Proof. Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College. Kurt Gödel
Gödel s Proof Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College Kurt Gödel 24.4.06-14.1.78 1 ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA MATHEMATICA AND RELATED SYSTEMS 11 by Kurt Gödel,
More informationHuan Long Shanghai Jiao Tong University
Huan Long Shanghai Jiao Tong University Paradox Equinumerosity Cardinal Numbers Infinite Cardinals Paradox and ZFC Equinumerosity Ordering Countable sets Paradox Axiomatic set theory Modern set theory
More informationHilbert s problems, Gödel, and the limits of computation
Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University November 14, 2013 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert
More informationMath 144 Summer 2012 (UCR) Pro-Notes June 24, / 15
Before we start, I want to point out that these notes are not checked for typos. There are prbally many typeos in them and if you find any, please let me know as it s extremely difficult to find them all
More informationRESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY. Feng Xu ( Abstract
RESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY Feng Xu (e-mail: xtwan@yahoo.com) Abstract The set of all the subsets of a set is its power set, and the cardinality of the power set is
More informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationSets and Infinity. James Emery. Edited: 2/25/ Cardinal Numbers 1. 2 Ordinal Numbers 6. 3 The Peano Postulates for the Natural Numbers 7
Sets and Infinity James Emery Edited: 2/25/2017 Contents 1 Cardinal Numbers 1 2 Ordinal Numbers 6 3 The Peano Postulates for the Natural Numbers 7 4 Metric Spaces 8 5 Complete Metric Spaces 8 6 The Real
More informationTo Infinity and Beyond
University of Waterloo How do we count things? Suppose we have two bags filled with candy. In one bag we have blue candy and in the other bag we have red candy. How can we determine which bag has more
More informationViolating the Singular Cardinals Hypothesis Without Large Cardinals
Violating the Singular Cardinals Hypothesis Without Large Cardinals CUNY Logic Workshop, November 18, 2011 by Peter Koepke (Bonn); joint work with Moti Gitik (Tel Aviv) Easton proved that the behavior
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationSOME TRANSFINITE INDUCTION DEDUCTIONS
SOME TRANSFINITE INDUCTION DEDUCTIONS SYLVIA DURIAN Abstract. This paper develops the ordinal numbers and transfinite induction, then demonstrates some interesting applications of transfinite induction.
More informationThe Calculus of Inductive Constructions
The Calculus of Inductive Constructions Hugo Herbelin 10th Oregon Programming Languages Summer School Eugene, Oregon, June 16-July 1, 2011 1 Outline - A bit of history, leading to the Calculus of Inductive
More informationBasic set-theoretic techniques in logic Part III, Transfinite recursion and induction
Basic set-theoretic techniques in logic Part III, Transfinite recursion and induction Benedikt Löwe Universiteit van Amsterdam Grzegorz Plebanek Uniwersytet Wroc lawski ESSLLI 2011, Ljubljana, Slovenia
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationINCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation
INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation to Mathematics Series Department of Mathematics Ohio
More informationTheory of Computation CS3102 Spring 2014
Theory of Computation CS0 Spring 0 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njbb/theory
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationMathematical Logic. Giuseppe Peano ( ) Core Logic 2004/05-1ab p. 2/2
Mathematical Logic. From the XIXth century to the 1960s, logic was essentially mathematical. Development of first-order logic (1879-1928): Frege, Hilbert, Bernays, Ackermann. Development of the fundamental
More informationThe Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)
The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) From the webpage of Timithy Kohl, Boston University INTRODUCTION Note. We will consider infinity from two different perspectives:
More information1 of 8 7/15/2009 3:43 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 6. Cardinality Definitions and Preliminary Examples Suppose that S is a non-empty collection of sets. We define a relation
More informationProof Theory and Subsystems of Second-Order Arithmetic
Proof Theory and Subsystems of Second-Order Arithmetic 1. Background and Motivation Why use proof theory to study theories of arithmetic? 2. Conservation Results Showing that if a theory T 1 proves ϕ,
More informationSection 7.5: Cardinality
Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many
More informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationTHE MATHEMATICAL UNIVERSE IN A NUTSHELL
THE MATHEMATICAL UNIVERSE IN A NUTSHELL K. K. NAMBIAR ABSTRACT. The mathematical universe discussed here gives models of possible structures our physical universe can have. Keywords Cosmology, White Hole,
More informationViolating the Singular Cardinals Hypothesis Without Large Cardinals
Violating the Singular Cardinals Hypothesis Without Large Cardinals Talk at the University of Bristol by Peter Koepke (Bonn), joint work with Moti Gitik (Jerusalem) November 29, 2010 Cantor s Continuum
More informationABOUT THE CLASS AND NOTES ON SET THEORY
ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationThe Axiom of Choice and its Discontents
The Axiom of Choice and its Discontents Jacob Alexander Gross University Of Pittsburgh jag218@pitt.edu February 22, 2016 Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents
More informationContents Propositional Logic: Proofs from Axioms and Inference Rules
Contents 1 Propositional Logic: Proofs from Axioms and Inference Rules... 1 1.1 Introduction... 1 1.1.1 An Example Demonstrating the Use of Logic in Real Life... 2 1.2 The Pure Propositional Calculus...
More informationCITS2211 Discrete Structures (2017) Cardinality and Countability
CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics
More informationOn numbers. A pearl seminar Mats Ehrnström
On numbers A pearl seminar 8.3 2013 Mats Ehrnström We actually need to count. We actually need to count. We actually need to count. But already know, without having counted all, many of us feel we have
More information1. (B) The union of sets A and B is the set whose elements belong to at least one of A
1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to
More informationDescription of the book Set Theory
Description of the book Set Theory Aleksander B laszczyk and S lawomir Turek Part I. Basic set theory 1. Sets, relations, functions Content of the chapter: operations on sets (unions, intersection, finite
More informationLecture Notes for MATH Mathematical Logic 1
Lecture Notes for MATH2040 - Mathematical Logic 1 Michael Rathjen School of Mathematics University of Leeds Autumn 2009 Chapter 0. Introduction Maybe not all areas of human endeavour, but certainly the
More informationPhilosophies of Mathematics. The Search for Foundations
Philosophies of Mathematics The Search for Foundations Foundations What are the bedrock, absolutely certain, immutable truths upon which mathematics can be built? At one time, it was Euclidean Geometry.
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More informationHenk Barendregt and Freek Wiedijk assisted by Andrew Polonsky. Radboud University Nijmegen. March 5, 2012
1 λ Henk Barendregt and Freek Wiedijk assisted by Andrew Polonsky Radboud University Nijmegen March 5, 2012 2 reading Femke van Raamsdonk Logical Verification Course Notes Herman Geuvers Introduction to
More informationA BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox
A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular
More informationOn Transfinite Cardinal Numbers
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 14, Issue 4 Ver. IV (Jul - Aug 2018), PP 17-21 www.iosrjournals.org On Transfinite Cardinal Numbers J N Salunke* and B
More informationX = { X f X i A i : (œx, y 0 X)[x /= y œi[ x i /= y i ]]}.
CARDINALS II James T. Smith San Francisco State University These notes develop the part of cardinal arithmetic that depends on the axiom of choice. The first result is the comparability theorem: every
More informationSELF-DUAL UNIFORM MATROIDS ON INFINITE SETS
SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS NATHAN BOWLER AND STEFAN GESCHKE Abstract. We extend the notion of a uniform matroid to the infinitary case and construct, using weak fragments of Martin s Axiom,
More informationmat.haus project Zurab Janelidze s Lectures on UNIVERSE OF SETS last updated 18 May 2017 Stellenbosch University 2017
Zurab Janelidze s Lectures on UNIVERSE OF SETS last updated 18 May 2017 Stellenbosch University 2017 Contents 1. Axiom-free universe of sets 1 2. Equality of sets and the empty set 2 3. Comprehension and
More informationLet us first solve the midterm problem 4 before we bring up the related issues.
Math 310 Class Notes 6: Countability Let us first solve the midterm problem 4 before we bring up the related issues. Theorem 1. Let I n := {k N : k n}. Let f : I n N be a one-toone function and let Im(f)
More informationOpen access to the SEP is made possible by a world-wide funding initiative. Please Read How You Can Help Keep the Encyclopedia Free
1 of 9 27/04/2012 12:28 PM Open access to the SEP is made possible by a world-wide funding initiative. Set Theory First published Thu Jul 11, 2002 Please Read How You Can Help Keep the Encyclopedia Free
More informationCantor and sets: La diagonale du fou
Judicaël Courant 2011-06-17 Lycée du Parc (moving to Lycée La Martinière-Monplaisir) Outline 1 Cantor s paradise 1.1 Introduction 1.2 Countable sets 1.3 R is not countable 1.4 Comparing sets 1.5 Cardinals
More informationCSCI3390-Lecture 6: An Undecidable Problem
CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or
More informationThe λ-calculus and Curry s Paradox Drew McDermott , revised
The λ-calculus and Curry s Paradox Drew McDermott drew.mcdermott@yale.edu 2015-09-23, revised 2015-10-24 The λ-calculus was invented by Alonzo Church, building on earlier work by Gottlob Frege and Moses
More informationB1.2 Set Theory. Lecture notes HT 2018 Jonathan Pila
1 B1.2 Set Theory Lecture notes HT 2018 Jonathan Pila Contents 1. Introduction 2. The language of Set Theory and the first axioms 3. The Powerset axiom 4. The Axiom of Infinity and the natural numbers
More informationhal , version 1-21 Oct 2009
ON SKOLEMISING ZERMELO S SET THEORY ALEXANDRE MIQUEL Abstract. We give a Skolemised presentation of Zermelo s set theory (with notations for comprehension, powerset, etc.) and show that this presentation
More informationHuan Long Shanghai Jiao Tong University
Huan Long Shanghai Jiao Tong University Basic set theory Relation Function Georg Cantor(1845-1918) ogerman mathematician o Founder of set theory Bertrand Russell(1872-1970) obritish philosopher, logician,
More informationOn Recognizable Languages of Infinite Pictures
On Recognizable Languages of Infinite Pictures Equipe de Logique Mathématique CNRS and Université Paris 7 LIF, Marseille, Avril 2009 Pictures Pictures are two-dimensional words. Let Σ be a finite alphabet
More informationDO FIVE OUT OF SIX ON EACH SET PROBLEM SET
DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,
More informationChapter 4. Basic Set Theory. 4.1 The Language of Set Theory
Chapter 4 Basic Set Theory There are two good reasons for studying set theory. First, it s a indispensable tool for both logic and mathematics, and even for other fields including computer science, linguistics,
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationAutomata Theory. Definition. Computational Complexity Theory. Computability Theory
Outline THEORY OF COMPUTATION CS363, SJTU What is Theory of Computation? History of Computation Branches and Development Xiaofeng Gao Dept. of Computer Science Shanghai Jiao Tong University 2 The Essential
More informationA Set Theory Formalization
Research Practice Final Report A Set Theory Formalization Alejandro Calle-Saldarriaga acalles@eafit.edu.co Mathematical Engineering, Universidad EAFIT Tutor: Andrés Sicard-Ramírez June 3, 2017 1 Problem
More informationSet Theory in Computer Science A Gentle Introduction to Mathematical Modeling
Set Theory in Computer Science A Gentle Introduction to Mathematical Modeling José Meseguer University of Illinois at Urbana-Champaign Urbana, IL 61801, USA c José Meseguer, 2008 and 2009; all rights reserved.
More informationMATH 220C Set Theory
MATH 220C Set Theory L A TEX by Kevin Matthews Spring 2017 (Updated January 7, 2018) Continuum Hypothesis Definition 0.0.1 (Same Cardinality). Two sets A, B have the same cardinality iff there is a bijection
More informationHoTT seminar organization
HoTT seminar 2017 organization Join us this semester to find out: whether it is true that "identity is equivalent to equivalence", why the homotopy groups of spheres and the algorithms for type checking
More informationIncompleteness Theorems, Large Cardinals, and Automata ov
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS and Université Paris 7 TAMC 2017, Berne
More informationMATHEMATICS = SET THEORY? 1.1. Set theory. No one shall drive us out of the paradise that Cantor has created David Hilbert
CHAPTER 1 MATHEMATICS = SET THEORY? No one shall drive us out of the paradise that Cantor has created David Hilbert 1.1. Set theory The basic concept upon which the discipline known as set theory rests
More informationLecture 2: What is Proof?
Lecture 2: What is Proof? Math 295 08/26/16 Webster Proof and Its History 8/2016 1 / 1 Evolution of Proof Proof, a relatively new idea Modern mathematics could not be supported at its foundation, nor construct
More informationMath 5801 General Topology and Knot Theory
Lecture 2-8/24/2012 Math 5801 Ohio State University August 24, 2012 Course Info Textbook (required) J. R. Munkres, Topology (2nd Edition), Prentice Hall, Englewood Cliffs, NJ, 2000. ISBN-10: 0131816292
More informationIntroduction to Proofs
Introduction to Proofs Notes by Dr. Lynne H. Walling and Dr. Steffi Zegowitz September 018 The Introduction to Proofs course is organised into the following nine sections. 1. Introduction: sets and functions
More informationChurch s undecidability result
Church s undecidability result Alan Turing Birth Centennial Talk at IIT Bombay, Mumbai Joachim Breitner April 21, 2011 Welcome, and thank you for the invitation to speak about Church s lambda calculus
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
More informationVI I : The Axiom of Choice and related properties
VI I : The Axiom of Choice and related properties Near the end of Section V I.4 we listed several basic questions about transfinite cardinal numbers, and we shall restate them here for the sake of convenience:
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationSet Theory. CSE 215, Foundations of Computer Science Stony Brook University
Set Theory CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 Set theory Abstract set theory is one of the foundations of mathematical thought Most mathematical
More informationNOTES FOR 197, SPRING 2018
NOTES FOR 197, SPRING 2018 We work in ZFDC, Zermelo-Frankel Theory with Dependent Choices, whose axioms are Zermelo s I - VII, the Replacement Axiom VIII and the axiom DC of dependent choices; when we
More informationParadox Machines. Christian Skalka The University of Vermont
Paradox Machines Christian Skalka The University of Vermont Source of Mathematics Where do the laws of mathematics come from? The set of known mathematical laws has evolved over time (has a history), due
More informationWHITE HOLE, BLACK WHOLE, AND THE BOOK
WHITE HOLE, BLACK WHOLE, AND THE BOOK K. K. NAMBIAR ABSTRACT. Physical and intellectual spaces are visualized making use of concepts from intuitive set theory. Intellectual space is defined as the set
More informationA SYSTEM OF AXIOMATIC SET THEORY PART VI 62
THE JOOBNAL OF SYMBOLIC LOGIC Volume 13, Number 2, June 1948 A SYSTEM OF AXIOMATIC SET THEORY PART VI 62 PAUL BEKNAYS 16. The r61e of the restrictive axiom. Comparability of classes. Till now we tried
More informationCantor s Letter to Dedekind
Cantor s Letter to Dedekind (Halle, 28 July 1899) Áron Dombrovszki October 24, 2017 Introducion in the first part of his letter, Cantor deals with the same contradiction as Burali-Forti about the multiplicity
More informationLecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson
Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem Michael Beeson The hypotheses needed to prove incompleteness The question immediate arises whether the incompleteness
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationIntroduction to Logic and Axiomatic Set Theory
Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some
More informationComputability Theory. CS215, Lecture 6,
Computability Theory CS215, Lecture 6, 2000 1 The Birth of Turing Machines At the end of the 19th century, Gottlob Frege conjectured that mathematics could be built from fundamental logic In 1900 David
More informationCS 173: Discrete Structures. Eric Shaffer Office Hour: Wed. 1-2, 2215 SC
CS 173: Discrete Structures Eric Shaffer Office Hour: Wed. 1-2, 2215 SC shaffer1@illinois.edu Agenda Sets (sections 2.1, 2.2) 2 Set Theory Sets you should know: Notation you should know: 3 Set Theory -
More informationGÖDEL S CONSTRUCTIBLE UNIVERSE
GÖDEL S CONSTRUCTIBLE UNIVERSE MICHAEL WOLMAN Abstract. This paper is about Gödel s Constructible Universe and the relative consistency of Zermelo-Fraenkel set theory, the Continuum Hypothesis and the
More informationZermelo-Fraenkel Set Theory
Zermelo-Fraenkel Set Theory H.C. Doets April 17, 2002 Contents 1 Introduction 3 2 Axioms 5 3 Natural Numbers 11 3.1 Peano Axioms................................... 11 3.2 Set-theoretic Definition of IN..........................
More informationInitial Ordinals. Proposition 57 For every ordinal α there is an initial ordinal κ such that κ α and α κ.
Initial Ordinals We now return to ordinals in general and use them to give a more precise meaning to the notion of a cardinal. First we make some observations. Note that if there is an ordinal with a certain
More informationMath 5801 General Topology and Knot Theory
Lecture 3-8/27/2012 Math 5801 Ohio State University August 27, 2012 Course Info Textbook (required) J. R. Munkres, Topology (2nd Edition), Prentice Hall, Englewood Cliffs, NJ, 2000. ISBN-10: 0131816292
More information