The Axiom of Choice and its Discontents

Size: px
Start display at page:

Download "The Axiom of Choice and its Discontents"

Transcription

1 The Axiom of Choice and its Discontents Jacob Alexander Gross University Of Pittsburgh February 22, 2016 Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

2 Outline 1 What is the axiom of choice? 2 Origins of the Axiom 3 Why it is Obviously True 4 Hilbert and Brouwer Duke it Out 5 Current Status 6 The Godel-Gentzen Translation 7 The Banach-Tarski Paradox 8 Godel and Cohen Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

3 What is the axiom of choice? An axiom is a proposition taken to be true without proof one must begin somewhere. Axioms are supposed to be self-evident The axiom of choice is often considered the most controversial axiom in the history of mathematics. Specifically it says: Let C be a nonempty collection of sets. Then, there exists a function f (called a choice function) defined on C such that f (S) S, for all S C. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

4 Equivalents The Well-Ordering Theorem says that any set can be well-ordered. Zorn s Lemma says that if (A, <) is a poset such that every chain in A is bounded above in A, then a A there exists an maximal element greater than a. Both of these are equivalent to the axiom of choice. The Hausdorff Maximality Principle (HMP) and the Tukey-Teichmuller lemma are also equivalent. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

5 Equivalents The Well-Ordering Theorem says that any set can be well-ordered. Zorn s Lemma says that if (A, <) is a poset such that every chain in A is bounded above in A, then a A there exists an maximal element greater than a. Both of these are equivalent to the axiom of choice. The Hausdorff Maximality Principle (HMP) and the Tukey-Teichmuller lemma are also equivalent. Joke: The axiom of choice is obviously true, the well-ordering theorem is obviously false and nobody understands Zorn s lemma. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

6 Origins of the Axiom The axiom of choice was first formulated in 1904 by Ernst Zermelo (in a different form using what he called coverings ). The Well-Ordering Theorem was fundamental in Cantor s transfinite arithmetic and was an open problem at the time (proved by Zermelo s invokation of the AC). The French pre-intuitionists Lebesgue, Baire and Borel rejected this on the belief that a mathematical object exists just in case it can be explicitly defined. There were also worries that the introducing the axiom may cause set theory to be inconsistent. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

7 Why it is Obviously True In 1904 Russell shows the that AC implies an empty product may be non-empty. Russell contends AC is a multiplicative axiom, to ensure the product of nonzero cardinals is nonzero. The axiom of choice is required to prove that every vector space has a basis. The axiom of choice is required to prove that every proper ideal is contained in a maximal ideal. There are many other crucial mathematical results relying on the axiom of choice (Tychnoff s theorem, all isotropic spaces are contained in Lagrangian spaces, etc.). Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

8 Hilbert and Brouwer Duke it Out David Hilbert was a renowned mathematician heavily involved in the foundations of mathematics. Early in Hilbert s career he proved Hilbert s basis theorem which proved the existence of a basis for finite invariants. Hilbert did not prove this by explicitly saying what the basis was, only that it would be contradictory for it not to exist. Paul Gordan (the King of Invariant Theory ) allegedly said Hilbert s paper is not mathematics, it is theology. Hilbert saw this kind of non-constructive argument as absolutely central to mathematics. Hilbert endorsed the axiom of choice as an essential mathematical principle. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

9 Hilbert and Brouwer Duke it Out Brouwer was a tremendous mathematician aside from his involvement in foundations (Brouwer s fixed point theorem, the degree of a map, etc.). His paper On the Unreliability of Logical Principles openly challenged the law of excluded middle. Without it, proving an existential means giving an explicit construction. Hilbert was vehemently opposed saying Taking the law of the excluded middle from the mathematician is like prohibiting a boxer the use of his fists. It is provable that without the law of the excluded middle, we do not have choice either (there is a caveat here involving something called a locally cartesian closed category if you are interested in this talk to me afterwards). Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

10 Current Status of the Axiom of Choice Weyl, Markov, Bishop and Martin-Lof followed in Brouwer s footsteps. Today most mathematicians accept the axiom of choice and the law of the excluded middle. Your Professor will let you use them on tests and homework... you might even get extra credit if you use the axiom of choice in a clever way. Due to the controversial nature of AC, if a theorem depends on choice it is customary to point this out. Zorn s Lemma probably the most popular form of AC for use in pure mathematics. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

11 The Godel-Gentzen Translation The Godel-Gentzen translation gives a way to translate classical proofs into constructive ones. It can be made precise by recursion on first-order formulas but we will not do that here. Basic idea of GG translation Classical Mathematician I proved Hilbert s basis theorem! Constructive Mathematician No you did not! You proved Hilbert s basis theorem cannot possibly be false! Classical Mathematician Whatever. To me, its the same thing. Constructive Mathematician Well to me its not but I understand what you re saying. For this reason intuistionistic logic is more expressive than classical logic. The intuitionistic existential and disjunction are more specific than their classical counterparts. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

12 The Banach-Tarski Paradox 1 The Banach-Tarski paradox was first stated in The original statement was that one could take a ball, slice it up into only 6 pieces and then, using only rigid motions, put these pieces back together into two balls of equal size and volume as the first. 3 More generally it is a theorem that one can cut up a ball the size of a pea and put the pieces (rigidly) back together to form a ball the size of the sun. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

13 The Banach-Tarski Paradox 1 The Banach-Tarski paradox was first stated in The original statement was that one could take a ball, slice it up into only 6 pieces and then, using only rigid motions, put these pieces back together into two balls of equal size and volume as the first. 3 More generally it is a theorem that one can cut up a ball the size of a pea and put the pieces (rigidly) back together to form a ball the size of the sun. 4 This result relies on the axiom of choice. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

14 The Banach-Tarski Paradox 1 The Banach-Tarski paradox was first stated in The original statement was that one could take a ball, slice it up into only 6 pieces and then, using only rigid motions, put these pieces back together into two balls of equal size and volume as the first. 3 More generally it is a theorem that one can cut up a ball the size of a pea and put the pieces (rigidly) back together to form a ball the size of the sun. 4 This result relies on the axiom of choice. 5 We either reject the axiom of choice or say the ball was sliced up into a pile that cannot be assigned a measure in any meaningful sense. 6 Indeed there are models of analysis where all sets are measurable... so long as they exclude choice. Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

15 Godel and Cohen In 1940 Kurt Godel put to rest the suspicions that introducing the axiom of choice caused set theory to be inconsistent. He proved that the axiom of choice is consistent with von Neumann-Godel-Bernays set theory (a more conservative version of ZF set theory). acob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

16 Godel and Cohen In 1940 Kurt Godel put to rest the suspicions that introducing the axiom of choice caused set theory to be inconsistent. He proved that the axiom of choice is consistent with von Neumann-Godel-Bernays set theory (a more conservative version of ZF set theory). In 1963, Paul Cohen proved that AC is also consistent with set theory. acob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

17 Godel and Cohen In 1940 Kurt Godel put to rest the suspicions that introducing the axiom of choice caused set theory to be inconsistent. He proved that the axiom of choice is consistent with von Neumann-Godel-Bernays set theory (a more conservative version of ZF set theory). In 1963, Paul Cohen proved that AC is also consistent with set theory. The axiom of choice is completely independent from the other axioms.. acob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

18 References I [1] Banach, S. and Tarski, A. Sur la decomposition des ensembles de points en parties respectivement congruentes. Fund. Math. 6, , [2] Bell, John L., The Axiom of Choice, The Stanford Encyclopedia of Philosophy (Summer 2015 Edition), Edward N. Zalta (ed.), URL = < [3] Machover, Mosh (1996) Set Theory, Logic and Their Limitations. Cambridge. [4] MacLane, S. and Moerdijk, I. Sheaves in Geometry and Logic A first introduction to topos theory. Springer Verlag, [5] Strombers, K. The Banach-Tarski Paradox. Amer. Math. Monthly. 86 3, Jacob Alexander Gross (University of Pittsburgh)The Axiom of Choice and its Discontents February 22, / 13

The Axiom of Choice and the Banach-Tarski Paradox

The Axiom of Choice and the Banach-Tarski Paradox The Axiom of Choice and the Banach-Tarski Paradox Department of Mathematical Sciences Lakehead University March 2011 The Axiom of Choice Axiom of Choice (Suppes 1960) For any set A there is a function

More information

Products, Relations and Functions

Products, Relations and Functions Products, Relations and Functions For a variety of reasons, in this course it will be useful to modify a few of the settheoretic preliminaries in the first chapter of Munkres. The discussion below explains

More information

The Axiom of Choice and Zorn s Lemma

The Axiom of Choice and Zorn s Lemma The Axiom of Choice and Zorn s Lemma Any indexed family of sets A ={Ai: i I} may be conceived as a variable set, to wit, as a set varying over the index set I. Each Ai is then the value of the variable

More information

Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma

Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma 0.7. The Axiom of Choice, Order, and Zorn s Lemma 1 Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma Note. In this section, we state the Axiom of Choice and two statements equivalent to it (Zorn

More information

CHAPTER 11. Introduction to Intuitionistic Logic

CHAPTER 11. Introduction to Intuitionistic Logic CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed

More information

Set Theory History. Martin Bunder. September 2015

Set Theory History. Martin Bunder. September 2015 Set Theory History Martin Bunder September 2015 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))

More information

Introduction to dependent type theory. CIRM, May 30

Introduction to dependent type theory. CIRM, May 30 CIRM, May 30 Goals of this presentation Some history and motivations Notations used in type theory Main goal: the statement of main properties of equality type and the univalence axiom First talk P ropositions

More information

VI I : The Axiom of Choice and related properties

VI 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 information

How Philosophy Impacts on Mathematics

How Philosophy Impacts on Mathematics .. How Philosophy Impacts on Mathematics Yang Rui Zhi Department of Philosophy Peking University Fudan University March 20, 2012 Yang Rui Zhi (PKU) Philosophical Impacts on Mathematics 20 Mar. 2012 1 /

More information

Dr. Bob s Axiom of Choice Centennial Lecture Fall A Century Ago

Dr. Bob s Axiom of Choice Centennial Lecture Fall A Century Ago Dr. Bob s Axiom of Choice Centennial Lecture Fall 2008 Ernst Zermelo, 1871 1953 A Century Ago Note. This year (2008) marks the 100 year anniversary of Ernst Zermelo s first statement of the currently accepted

More information

INCOMPLETENESS 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 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 information

The Search for the Perfect Language

The 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 information

Gö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 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 information

Trees and generic absoluteness

Trees and generic absoluteness in ZFC University of California, Irvine Logic in Southern California University of California, Los Angeles November 6, 03 in ZFC Forcing and generic absoluteness Trees and branches The method of forcing

More information

Sets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University

Sets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University Sets, Models and Proofs I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University 2000; revised, 2006 Contents 1 Sets 1 1.1 Cardinal Numbers........................ 2 1.1.1 The Continuum

More information

Report 1 The Axiom of Choice

Report 1 The Axiom of Choice Report 1 The Axiom of Choice By Li Yu This report is a collection of the material I presented in the first round presentation of the course MATH 2002. The report focuses on the principle of recursive definition,

More information

MAGIC Set theory. lecture 2

MAGIC 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 information

Structuring Logic with Sequent Calculus

Structuring Logic with Sequent Calculus Structuring Logic with Sequent Calculus Alexis Saurin ENS Paris & École Polytechnique & CMI Seminar at IIT Delhi 17th September 2004 Outline of the talk Proofs via Natural Deduction LK Sequent Calculus

More information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic 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 information

Set Theory and the Foundation of Mathematics. June 19, 2018

Set 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 information

Sets 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/ 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 information

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.

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 information

SJÄLVSTÄNDIGA ARBETEN I MATEMATIK

SJÄLVSTÄNDIGA ARBETEN I MATEMATIK SJÄLVSTÄNDIGA ARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Choice Principles in Mathematics av Simon Almerström Przybyl 2015 - No 6 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET,

More information

Proof Theory and Subsystems of Second-Order Arithmetic

Proof 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 information

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics

More information

Maximal Introspection of Agents

Maximal Introspection of Agents Electronic Notes in Theoretical Computer Science 70 No. 5 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages Maximal Introspection of Agents Thomas 1 Informatics and Mathematical Modelling

More information

A Set Theory Formalization

A 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 information

The Uniform Distributions Puzzle

The Uniform Distributions Puzzle The Uniform Distributions Puzzle Luc Lauwers Center for Economic Studies, K.U.Leuven Naamsestraat 69, B-3000 Leuven, BELGIUM Luc.Lauwers@econ.kuleuven.be July 17, 2007 In the usual, countably additive

More information

The Axiom of Choice and Some Equivalences:

The Axiom of Choice and Some Equivalences: The Axiom of Choice and Some Equivalences: A Senior Exercise Tate Deskins Department of Mathematics Kenyon College November 29, 2012 1 CONTENTS Contents 1 Introduction and Motivation 3 1.1 Overview..............................

More information

The Axiom of Choice. Contents. 1 Motivation 2. 2 The Axiom of Choice 2. 3 Two powerful equivalents of AC 4. 4 Zorn s Lemma 5. 5 Using Zorn s Lemma 6

The Axiom of Choice. Contents. 1 Motivation 2. 2 The Axiom of Choice 2. 3 Two powerful equivalents of AC 4. 4 Zorn s Lemma 5. 5 Using Zorn s Lemma 6 The Axiom of Choice Contents 1 Motivation 2 2 The Axiom of Choice 2 3 Two powerful equivalents of AC 4 4 Zorn s Lemma 5 5 Using Zorn s Lemma 6 6 More equivalences of AC 11 7 Consequences of the Axiom of

More information

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL THOMAS HOFWEBER PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL 1. PROOF-THEORETIC REDUCTION AND HILBERT S PROGRAM Hilbert s program in the philosophy of mathematics comes in two parts. One part is a

More information

Intuitionism and effective descriptive set theory

Intuitionism and effective descriptive set theory Intuitionism and effective descriptive set theory Joan R. Moschovakis and Yiannis N. Moschovakis Occidental College and University of California, Los Angeles L. E. J. Brouwer, fifty years later, Amsterdam,

More information

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY

Victoria 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 information

Creative Objectivism, a powerful alternative to Constructivism

Creative Objectivism, a powerful alternative to Constructivism Creative Objectivism, a powerful alternative to Constructivism Copyright c 2002 Paul P. Budnik Jr. Mountain Math Software All rights reserved Abstract It is problematic to allow reasoning about infinite

More information

König s Lemma and Kleene Tree

König s Lemma and Kleene Tree König s Lemma and Kleene Tree Andrej Bauer May 3, 2006 Abstract I present a basic result about Cantor space in the context of computability theory: the computable Cantor space is computably non-compact.

More information

A Crash Course in Topological Groups

A Crash Course in Topological Groups A Crash Course in Topological Groups Iian B. Smythe Department of Mathematics Cornell University Olivetti Club November 8, 2011 Iian B. Smythe (Cornell) Topological Groups Nov. 8, 2011 1 / 28 Outline 1

More information

Propositions as Types

Propositions as Types Propositions as Types Martin Pfeifhofer & Felix Schett May 25, 2016 Contents 1 Introduction 2 2 Content 3 2.1 Getting Started............................ 3 2.2 Effective Computability And The Various Definitions.......

More information

Part II. Logic and Set Theory. Year

Part II. Logic and Set Theory. Year Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]

More information

Mathematical Logic. Giuseppe Peano ( ) Core Logic 2004/05-1ab p. 2/2

Mathematical 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 information

ON A QUESTION OF SIERPIŃSKI

ON A QUESTION OF SIERPIŃSKI ON A QUESTION OF SIERPIŃSKI THEODORE A. SLAMAN Abstract. There is a set of reals U such that for every analytic set A there is a continuous function f which maps U bijectively to A. 1. Introduction A set

More information

A Semantics of Evidence for Classical Arithmetic

A Semantics of Evidence for Classical Arithmetic Thierry Coquand Chambery, June 5, 2009 Intuitionistic analysis of classical logic This work is motivated by the first consistency proof of arithmetic by Gentzen (1936) Unpublished by Gentzen (criticisms

More information

An Intuitively Complete Analysis of Gödel s Incompleteness

An Intuitively Complete Analysis of Gödel s Incompleteness An Intuitively Complete Analysis of Gödel s Incompleteness JASON W. STEINMETZ (Self-funded) A detailed and rigorous analysis of Gödel s proof of his first incompleteness theorem is presented. The purpose

More information

Theory of Computation CS3102 Spring 2014

Theory 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 information

Notes on the Banach-Tarski Paradox

Notes on the Banach-Tarski Paradox Notes on the Banach-Tarski Paradox Donald Brower May 6, 2006 The Banach-Tarski paradox is not a logical paradox, but rather a counter intuitive result. It says that a ball can be broken into a finite number

More information

Zermelo-Fraenkel Set Theory

Zermelo-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 information

The Gödel Hierarchy and Reverse Mathematics

The Gödel Hierarchy and Reverse Mathematics The Gödel Hierarchy and Reverse Mathematics Stephen G. Simpson Pennsylvania State University http://www.math.psu.edu/simpson/ simpson@math.psu.edu Symposium on Hilbert s Problems Today Pisa, Italy April

More information

Introduction to Logic and Axiomatic Set Theory

Introduction 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 information

On some Metatheorems about FOL

On some Metatheorems about FOL On some Metatheorems about FOL February 25, 2014 Here I sketch a number of results and their proofs as a kind of abstract of the same items that are scattered in chapters 5 and 6 in the textbook. You notice

More information

arxiv: v2 [math.gr] 4 Nov 2015

arxiv: v2 [math.gr] 4 Nov 2015 arxiv:1511.01019v2 [math.gr] 4 Nov 2015 A Paradoxical Decomposition of the Real Line Shelley Kandola and Sam Vandervelde Abstract. In this paper we demonstrate how to partition the real number line into

More information

ABOUT THE CLASS AND NOTES ON SET THEORY

ABOUT 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 information

Review: Stephen G. Simpson (1999) Subsystems of Second-Order Arithmetic (Springer)

Review: Stephen G. Simpson (1999) Subsystems of Second-Order Arithmetic (Springer) Review: Stephen G. Simpson (1999) Subsystems of Second-Order Arithmetic (Springer) Jeffrey Ketland, February 4, 2000 During the nineteenth century, and up until around 1939, many major mathematicians were

More information

Zermelo-Frankel Set Theory and Well Orderings

Zermelo-Frankel Set Theory and Well Orderings Zermelo-Frankel Set Theory and Well Orderings Menaka Lashitha Bandara 16 May 2006 Abstract In 1883, Georg Cantor proposed that it was a valid law of thought that every set can be well ordered. This Well

More information

The Legacy of Hilbert, Gödel, Gentzen and Turing

The 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 information

Synthetic Computability

Synthetic Computability Synthetic Computability Andrej Bauer Department of Mathematics and Physics University of Ljubljana Slovenia MFPS XXIII, New Orleans, April 2007 What is synthetic mathematics? Suppose we want to study mathematical

More information

Constructive (functional) analysis

Constructive (functional) analysis Constructive (functional) analysis Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Proof and Computation, Fischbachau,

More information

1. (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 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 information

Constructive decidability of classical continuity

Constructive decidability of classical continuity Constructive decidability of classical continuity Martín H. Escardó Version of March 27, 2012 Abstract We show that the following instance of the principle of excluded holds: any function on the one-point

More information

The Independence of Peano's Fourth Axiom from. Martin-Lof's Type Theory without Universes. Jan M. Smith. Department of Computer Science

The Independence of Peano's Fourth Axiom from. Martin-Lof's Type Theory without Universes. Jan M. Smith. Department of Computer Science The Independence of Peano's Fourth Axiom from Martin-Lof's Type Theory without Universes Jan M. Smith Department of Computer Science University of Goteborg/Chalmers S-412 96 Goteborg Sweden March 1987

More information

Outside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis

Outside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis Outside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis Tali Magidson June 6, 2017 Synopsis In June 2002, "Two Classical Surprises Concerning the Axiom of Choice and the Continuum

More information

A BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox

A 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 information

Classical Propositional Logic

Classical Propositional Logic The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,

More information

Cantor (1). Georg Cantor ( ) studied in Zürich, Berlin, Göttingen Professor in Halle

Cantor (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 information

Contents Propositional Logic: Proofs from Axioms and Inference Rules

Contents 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 information

FUNDAMENTALS OF REAL ANALYSIS

FUNDAMENTALS OF REAL ANALYSIS ÜO i FUNDAMENTALS OF REAL ANALYSIS James Foran University of Missouri Kansas City, Missouri Marcel Dekker, Inc. New York * Basel - Hong Kong Preface iii 1.1 Basic Definitions and Background Material 1

More information

Gödel s Incompleteness Theorems by Sally Cockburn (2016)

Gödel s Incompleteness Theorems by Sally Cockburn (2016) Gödel s Incompleteness Theorems by Sally Cockburn (2016) 1 Gödel Numbering We begin with Peano s axioms for the arithmetic of the natural numbers (ie number theory): (1) Zero is a natural number (2) Every

More information

Type Theory and Constructive Mathematics. Type Theory and Constructive Mathematics Thierry Coquand. University of Gothenburg

Type Theory and Constructive Mathematics. Type Theory and Constructive Mathematics Thierry Coquand. University of Gothenburg Type Theory and Constructive Mathematics Type Theory and Constructive Mathematics Thierry Coquand University of Gothenburg Content An introduction to Voevodsky s Univalent Foundations of Mathematics The

More information

Difficulties of the set of natural numbers

Difficulties of the set of natural numbers Difficulties of the set of natural numbers Qiu Kui Zhang Nanjing University of Information Science and Technology 210044 Nanjing, China E-mail: zhangqk@nuist.edu.cn Abstract In this article some difficulties

More information

The Philosophy of Mathematics after Foundationalism

The Philosophy of Mathematics after Foundationalism The Philosophy of Mathematics after Foundationalism Dan Goodman November 5, 2005 1 Introduction Philosophy of maths has come to mean something quite specific; namely logic, set theory and the foundations

More information

SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS

SELF-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 information

Almost von Neumann, Definitely Gödel: The Second Incompleteness Theorem s Early Story

Almost von Neumann, Definitely Gödel: The Second Incompleteness Theorem s Early Story L&PS Logic and Philosophy of Science Vol. IX, No. 1, 2011, pp. 151-158 Almost von Neumann, Definitely Gödel: The Second Incompleteness Theorem s Early Story Giambattista Formica Dipartimento di Filosofia,

More information

GENERAL TOPOLOGY JESPER M. MØLLER

GENERAL TOPOLOGY JESPER M. MØLLER GENERAL TOPOLOGY JESPER M. MØLLER Contents 1. Sets, functions and relations 3 1.1. Sets 3 1.2. Functions 3 1.5. Relations 4 2. The integers and the real numbers 7 3. Products and coproducts 9 4. Finite

More information

Real Analysis. a short presentation on what and why

Real Analysis. a short presentation on what and why Real Analysis a short presentation on what and why I. Fourier Analysis Fourier analysis is about taking functions and realizing them or approximating them in terms of periodic (trig) functions. Many, many

More information

The Calculus of Inductive Constructions

The 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 information

Constructive analysis

Constructive analysis Constructive analysis Philosophy, Proof and Fundamentals Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Interval

More information

Open access to the SEP is made possible by a world-wide funding initiative. Please Read How You Can Help Keep the Encyclopedia Free

Open 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 information

Abstract and Variable Sets in Category Theory 1

Abstract and Variable Sets in Category Theory 1 Abstract and Variable Sets in Category Theory 1 John L. Bell In 1895 Cantor gave a definitive formulation of the concept of set (menge), to wit, A collection to a whole of definite, well-differentiated

More information

RESOLVING RUSSELL S PARADOX WITHIN CANTOR S INTUITIVE SET THEORY. Feng Xu ( Abstract

RESOLVING 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 information

A SYSTEM OF AXIOMATIC SET THEORY PART VI 62

A 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 information

Supplement. Algebraic Closure of a Field

Supplement. Algebraic Closure of a Field Supplement: Algebraic Closure of a Field 1 Supplement. Algebraic Closure of a Field Note. In this supplement, we give some background material which is used in the proof of Fraleigh s Theorem 31.17/31.22

More information

Part II Logic and Set Theory

Part 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 information

The uniform distributions puzzle

The uniform distributions puzzle The uniform distributions puzzle by Luc LAUWERS Econometrics Center for Economic Studies Discussions Paper Series (DPS) 09.06 http://www.econ.kuleuven.be/ces/discussionpapers/default.htm March 2009 The

More information

Philosophies of Mathematics. The Search for Foundations

Philosophies 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 information

Foundations of Computation. Ana Bove

Foundations of Computation. Ana Bove Foundations of Computation Ana Bove Programming Logic (ProgLog) Group February 13th 2018 Outline of the talk: What we do in ProgLog Origines of computer science Courses in the area Warming-up Exercise

More information

Truth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation.

Truth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation. Outline 1 2 3 4 5 1 / 41 2 / 41 The Liar Sentence Let L be the sentence: This sentence is false This sentence causes trouble If it is true, then it is false So it can t be true Thus, it is false If it

More information

Observations on Category Theory. John L. Bell

Observations on Category Theory. John L. Bell Observations on Category Theory John L. Bell 1. Devised by Eilenberg and Mac Lane in the early 1940s, category theory is a presentation of mathematics in terms of the fundamental concepts of transformation,

More information

Hilbert s problems, Gödel, and the limits of computation

Hilbert 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 information

4 Choice axioms and Baire category theorem

4 Choice axioms and Baire category theorem Tel Aviv University, 2013 Measure and category 30 4 Choice axioms and Baire category theorem 4a Vitali set....................... 30 4b No choice....................... 31 4c Dependent choice..................

More information

Chapter 11: Automated Proof Systems (1)

Chapter 11: Automated Proof Systems (1) Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems

More information

Topos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.

Topos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello. logic s Lectures 17-20: logic in 2 / 40 logic s Interpreting first-order logic in In Logic, first-order s are a wide class of formal s used for talking about structures of any kind (where the restriction

More information

Lebesgue Measure on R n

Lebesgue Measure on R n CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets

More information

The Banach-Tarski paradox

The Banach-Tarski paradox The Banach-Tarski paradox 1 Non-measurable sets In these notes I want to present a proof of the Banach-Tarski paradox, a consequence of the axiom of choice that shows us that a naive understanding of the

More information

arxiv:math/ v2 [math.gn] 23 Sep 2003

arxiv:math/ v2 [math.gn] 23 Sep 2003 SPM BULLETIN arxiv:math/0305367v2 [math.gn] 23 Sep 2003 ISSUE NUMBER 5: MAY 2003 CE Contents 1. Editor s note 1 Contributions 2 Subscription 2 2. The Minimal Tower problem solved: A personal perspective

More information

Meta-logic derivation rules

Meta-logic derivation rules Meta-logic derivation rules Hans Halvorson February 19, 2013 Recall that the goal of this course is to learn how to prove things about (as opposed to by means of ) classical first-order logic. So, we will

More information

Löwnheim Skolem Theorem

Löwnheim Skolem Theorem Löwnheim Skolem Theorem David Pierce September 17, 2014 Mimar Sinan Fine Arts University http://mat.msgsu.edu.tr/~dpierce/ These notes are part of a general investigation of the Compactness Theorem. They

More information

General Topology. Jesper M. Møller

General Topology. Jesper M. Møller General Topology Jesper M. Møller Matematisk Institut, Universitetsparken 5, DK 2100 København E-mail address: moller@math.ku.dk URL: http://www.math.ku.dk/~moller Contents Chapter 0. Introduction 5 Chapter

More information

Constructing Ordinals

Constructing Ordinals Philosophia Scientiæ Travaux d'histoire et de philosophie des sciences CS 6 2006 Constructivism: Mathematics, Logic, Philosophy and Linguistics Constructing Ordinals Herman Ruge Jervell Publisher Editions

More information

Chapter 2 Axiomatic Set Theory

Chapter 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 information

Russell Sets, Topology, and Cardinals

Russell Sets, Topology, and Cardinals Russell Sets, Topology, and Cardinals Ethan Thomas Undergraduate Honors Thesis Professor Marcia Groszek, Advisor Department of Mathematics Dartmouth College May, 2014 i Abstract The Axiom of Choice is

More information

Homogeneous spaces and Wadge theory

Homogeneous spaces and Wadge theory Homogeneous spaces and Wadge theory Andrea Medini Kurt Gödel Research Center University of Vienna July 18, 2018 Everybody loves homogeneous stuff! Topological homogeneity A space is homogeneous if all

More information