Russel‘s paradox (also known as Russel‘s antimony)

Slides:



Advertisements
Similar presentations
PARADOX Chi-Kwong Li. A ‘ VISUAL ’ PARADOX : I LLUSION.
Advertisements

Fuzzy Sets and Fuzzy Logic
Mathematical Paradoxes
PARADOXES IN MATHEMATICS
Bertrand Russell “Do not fear to be eccentric in opinion, for every opinion now accepted was once eccentric.” Do not fear to be eccentric in opinion, for.
Copyright © Cengage Learning. All rights reserved.
Russell’s Paradox Jami Durkee Valerie Toothman Jason Prindell.
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,
Beyond Counting Infinity and the Theory of Sets Nate Jones & Chelsea Landis.
1 The Limits of Computation Intractable and Non-computable functions.
Prof. Johnnie Baker Module Basic Structures: Sets
Gödel’s Incompletness Theorem By Njegos Nincic. Overview  Set theory: Background, History Naïve Set Theory  Axiomatic Set Theory  Icompleteness Theorem.
Sets Lecture 11: Oct 24 AB C. This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
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.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 7: Beyond Classical Logic.
Instructor: Hayk Melikya
Limitations. Limitations of Computation Hardware precision Hardware precision Software - we’re human Software - we’re human Problems Problems –complex.
(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.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12- Completeness Proof; Self References and Paradoxes 16 th August,
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.
Math 333 – Euclidean and Non-Euclidean Geometry Dr. Hamblin.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Quit Paradoxes Schrödinger’s Cat Coastline of Ireland Koch Snowflake.
Sets 1.
Sets 1.
Cardinals Georg Cantor ( ) thought of a cardinal as a special represenative. Bertrand Russell ( ) and Gottlob Frege ( ) used the.
The Problems of Philosophy Philosophy 1 Spring, 2002 G. J. Mattey.
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
Set Theory A B C.
CS 2210 (22C:019) Discrete Structures Introduction and Scope: Propositions Spring 2015 Sukumar Ghosh.
Lecture 18. Unsolvability Before the 1930’s, mathematics was not like today. Then people believed that “everything true must be provable”. (More formally,
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.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12- Completeness Proof; Self References and Paradoxes 16 th August,
A Brief Introduction to Set Theory. How Many Things?
CompSci 102 Discrete Math for Computer Science
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.
Chapter 2 With Question/Answer Animations. Section 2.1.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Based on slides by Patrice Belleville and Steve Wolfman CPSC 121: Models of Computation Unit 11: Sets.
Based on slides by Patrice Belleville and Steve Wolfman CPSC 121: Models of Computation Unit 11: Sets.
 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.
Sets and Size Basic Question: Compare the “size” of sets. First distinction finite or infinite. –What is a finite set? –How can one compare finite sets?
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.
Week 7 - Wednesday.  What did we talk about last time?  Proving the subset relationship  Proving set equality  Set counterexamples  Laws of set algebra.
BERTRAND RUSSELL (18 May 1872 – 2 February 1970).
Emre ERDOĞAN CMPE 220. In the foundations of mathematics, Russell's paradox was discovered by Bertrand Arthur William Russell (18 May 1872.
Russell’s Paradox Is W in W? In words, W is the set that contains all the sets that don’t contain themselves. If W is in W, then W contains itself. But.
Mathematical Paradoxes
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Mathematics and Certainty
CS 2210:0001 Discrete Structures Introduction and Scope: Propositions
CSE 105 Theory of Computation
Sets Extended Maths © Adam Gibson.
Mathematics and Knowledge
دانشگاه شهیدرجایی تهران
Naïve Sets & Russell’s Paradox
تعهدات مشتری در کنوانسیون بیع بین المللی
CPSC 121: Models of Computation 2016W2
PHIL 2000 Tools for Philosophers 1st Term 2016
Sets, Sequences, and Summations
We about to get philosophical, yo. By Sara Parker
3 Lecture in math Sets theory.
Presentation transcript:

Russel‘s paradox (also known as Russel‘s antimony)

Bertrand Russel ( )  British philosopher, logician, mathematician, historian and social critic  Was awarded Nobel prize in literature  Is known for challenging foundations of mathematics by discovering Russel’s paradox

 Shows that naive set theory leads to a contradiction  According to this theory any definable collection is a set  Let R be the set of all sets that are not members of themselves  Symbolically: let R = {x | x ∉ x }

 If R is not a member of itself, then its definition dictates that it must contain itself  If it contains itself, then it contradicts its own definition as the set of all sets that are not members of themselves  Symbolically all together: let R = { x | x ∉ x }, then R ∈ R  R ∉ R

Applied versions  From the list of versions that are closer to real-life situations, the barber paradox is the most famous

Barber paradox  Suppose there is a town with just one barber, who is a male

 In this town every man keeps himself clean-shaven, doing exactly one of these things:  1.shaving himself  2.going to the barber

 Asking the question, “who shaves the barber ?” results in paradox  Both of the possibilities result in barber shaving himself, but this is not possible since he only shaves the men, who do not shave themselves

 There is no way to solve this paradox, it can only be avoided  Most famous way to avoid this paradox is Zermelo-Fraenkel’s set theory  In this set theory sets are constructed just using axioms

Thank you for attention