PHIL 2000 Tools for Philosophers 1st Term 2016

Slides:



Advertisements
Similar presentations
Some important properties Lectures of Prof. Doron Peled, Bar Ilan University.
Advertisements

Semantic Paradoxes Continued. RECAP The Barber Paradox Once upon a time there was a village, and in this village lived a barber named B. B shaved all.
PARADOX Chi-Kwong Li. A ‘ VISUAL ’ PARADOX : I LLUSION.
PROOF BY CONTRADICTION
Philosophy and Science
Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
The Liar and Dialetheism The Liar, the Strengthened Liar Dialetheism: Motivations and Problems Keith Allen Office Hour: Weds (D/140)
Remarks on Mathematical Logic: Paradoxes and Puzzles AAG Selmer Bringsjord The Minds & Machines Laboratory Department of Philosophy, Psychology.
Semantic Paradoxes.
Kant Philosophy Through the Centuries BRENT SILBY Unlimited (UPT)
Semantic Paradoxes. THE BARBER The Barber Paradox Once upon a time there was a village, and in this village lived a barber named B.
Copyright © Cengage Learning. All rights reserved.
Island of Knights and Knaves Jack says: “At least one of us is a knave.” Question: Is Jack a knight or knave? What about Jill? Answer: If Jack is a knave,
Gödel’s Incompletness Theorem By Njegos Nincic. Overview  Set theory: Background, History Naïve Set Theory  Axiomatic Set Theory  Icompleteness Theorem.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
Instructor: Hayk Melikya
2 February. Discussion Questions What’s the difference between Michael and {Michael}? What would happen if we said Michael = {Michael}?
(CSC 102) Discrete Structures Lecture 14.
Week 7 - Wednesday.  What did we talk about last time?  Set proofs and disproofs  Russell’s paradox.
2.1 Sets ‒Sets ‒Common Universal Sets ‒Subsets 2.2 Set Operations 2.3 Functions 2.4 Sequences and Summations 1.
Russel‘s paradox (also known as Russel‘s antimony)
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
First-order Set Theory Chapter 15 Language, Proof and Logic.
Sets SCIE Centre Additional Maths © Adam Gibson. Aims: To understand the idea of a set To be able to use the appropriate mathematical symbols (such as.
Quit Paradoxes Schrödinger’s Cat Coastline of Ireland Koch Snowflake.
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Copyright © Zeph Grunschlag, Set Operations Zeph Grunschlag.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
PARADOX Hui Hiu Yi Kary Chan Lut Yan Loretta Choi Wan Ting Vivian.
Mathematics and the Theory of Knowledge
Paradoxes Schrödinger’s Cat Koch Snowflake Coastline of Ireland.
Russell’s Paradox Lecture 24 Section 5.4 Fri, Mar 10, 2006.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
9 February. In Class Assignment #1 Set: {2, 4, 6, 8, 10} MEMBERSUBSETNEITHER 2 {4, 6} {2, 10} {} 3 {{2, 4}, 6, 8, 10}
PARADOXES Zeno's Paradoxes One can never reach the end of a racecourse, for in order to do so one would first have to reach the halfway mark, then the.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
Background Knowledge Results!. Part I For each of the following topics, rate each according to your level of prior knowledge of (familiarity with) that.
A Brief Introduction to Set Theory. How Many Things?
CompSci 102 Discrete Math for Computer Science
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
CSE 311 Foundations of Computing I Lecture 9 Proofs and Set Theory Autumn 2012 CSE
Chapter 2 With Question/Answer Animations. Section 2.1.
Based on slides by Patrice Belleville and Steve Wolfman CPSC 121: Models of Computation Unit 11: Sets.
Russell’s Paradox and the Halting Problem Lecture 24 Section 5.4 Wed, Feb 23, 2005.
Based on slides by Patrice Belleville and Steve Wolfman CPSC 121: Models of Computation Unit 11: Sets.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
 Founded in 1884 by Gottlob Frege and Richard Dedekind  Math can be reduced to 9 simple logical axioms  2 axioms are not logical  Axiom of infinity.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
Section 2.1. Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the.
Bertrand Russell ( ) From The Problems of Philosophy (1912)  Truth & Falsehood  Knowledge, Error, & Probable Opinion  The Limits of Philosophical.
EXAMPLE 3 Write an indirect proof Write an indirect proof that an odd number is not divisible by 4. GIVEN : x is an odd number. PROVE : x is not divisible.
To Infinity and Beyond!. Paradox A paradox is a seemingly consistent, logical argument that nonetheless ends with a ridiculous conclusion Like the story.
Chapter 2 Sets and Functions.
CPSC 121: Models of Computation 2012 Summer Term 2
Chapter 5, Set Theory 1.
Chapter 3 The Real Numbers.
The Liar Paradox.
Sets Extended Maths © Adam Gibson.
Set Theory A B C.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Naïve Sets & Russell’s Paradox
CPSC 121: Models of Computation 2016W2
Semantic Paradoxes.
THE LAWS OF LOGIC Let’s be reasonable!.
Presentation transcript:

PHIL 2000 Tools for Philosophers 1st Term 2016 Infinite Sets PHIL 2000 Tools for Philosophers 1st Term 2016

Topics for Discussion What are sets? Where are they? How do they relate to their members? Do they exist? How are they different from Venn diagrams? How many sets are there? Which axiom tells us this? How many empty sets are there?

Barber Paradox

The Barber Paradox Once upon a time there was a village, and in this village lived a barber named B.

The Barber Paradox B shaved all the villagers who did not shave themselves, And B shaved none of the villagers who did shave themselves.

The Barber Paradox Question, did B shave B, or not?

Suppose B Shaved B 1. B shaved B Assumption 2. B did not shave any villager X where X shaved X Assumption 3. B did not shave B 1,2 Logic

Suppose B Did Not Shave B 1. B did not shave B Assumption 2. B shaved every villager X where X did not shave X Assumption 3. B shaved B 1,2 Logic

Contradictions with Assumptions We can derive a contradiction from the assumption that B shaved B. We can derive a contradiction from the assumption that B did not shave B.

The Law of Excluded Middle Everything is either true or not true. Either P or not-P, for any P. Either B shaved B or B did not shave B, there is no third option.

It’s the Law Either it’s Tuesday or it’s not Tuesday. Either it’s Wednesday or it’s not Wednesday. Either killing babies is good or killing babies is not good. Either this sandwich is good or it is not good.

Disjunction Elimination A or B A implies C B implies C Therefore, C

Example Either Michael is dead or he has no legs If Michael is dead, he can’t run the race. If Michael has no legs, he can’t run the race. Therefore, Michael can’t run the race.

Contradiction, No Assumptions B shaves B or B does not shave B [Law of Excluded Middle] If B shaves B, contradiction. If B does not shave B, contradiction. Therefore, contradiction

Contradictions Whenever we are confronted with a contradiction, we need to give up something that led us into the contradiction.

A or B A implies C B implies C Therefore, C Give up Logic? For example, we used Logic in the proof that B shaved B if and only if B did not shave B. So we might consider giving up logic. A or B A implies C B implies C Therefore, C

No Barber In this instance, however, it makes more sense to give up our initial acquiescence to the story: We assumed that there was a village with a barber who shaved all and only the villagers who did not shave themselves.

The Barber Paradox The paradox shows us that there is no such barber, and that there cannot be.

Russell’s Paradox

The Axiom of Comprehension Basic idea of set theory: When you have some things, there is another thing, the collection of those things. For any condition C, there exists a set A such that: (For any x)(x is in A if and only if x satisfies C)

Bertrand Russell One of the founders of analytic philosophy (contemporary Anglophone philosophy). One of the greatest logicians of the 20th Century Showed that the basic idea of set theory can’t be right.

Russell’s Paradox Consider the condition: x is not a member of x

Russell’s Paradox According to the Axiom of Comprehension, there exists a set R such that: (For any x)(x is in R if and only if x satisfies “x is not a member of x”)

Russell’s Paradox According to the Axiom of Comprehension, there exists a set R such that: (For any x)(x is in R if and only if x is not a member of x)

Russell’s Paradox R = { x | x is not a member of x } Question: Is R a member of R?

Russell’s Paradox Let’s suppose: R is not a member of R. Then: R is a member of { x | x is not a member of x } Hence, R is a member of R

Russell’s Paradox Let’s suppose: R is a member of R. Then: R is a member of { x | x is not a member of x } Hence, R is not a member of R

Russell’s Paradox The Naïve Comprehension Schema leads to a contradiction. Therefore it is false. There are some properties with no corresponding set of things that have those properties.

Questions about Russell’s Paradox Is there something wrong with the condition? Does it make sense for a set to be a member of itself? Does it make sense for a set to not be a member of itself? Must set theory be false if its basic idea is?