Russell’s Paradox Lecture 24 Section 5.4 Fri, Mar 10, 2006.

Slides:



Advertisements
Similar presentations
Fall 2002CMSC Discrete Structures1 Follow me for a walk through... MathematicalInduction.
Advertisements

Lecture 3 Universal TM. Code of a DTM Consider a one-tape DTM M = (Q, Σ, Γ, δ, s). It can be encoded as follows: First, encode each state, each direction,
Section 7.5: Equivalence Relations Def: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Ex: Let.
Semantic Paradoxes.
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.
Prof. Johnnie Baker Module Basic Structures: Sets
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
CS 173: Discrete Mathematical Structures Cinda Heeren Rm 2213 Siebel Center Office Hours: M 12:30-2:30p.
© 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
(CSC 102) Discrete Structures Lecture 14.
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
3.3 Divisibility Definition If n and d are integers, then n is divisible by d if, and only if, n = dk for some integer k. d | n  There exists an integer.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Sets 1.
Sets 1.
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
Methods of Proof & Proof Strategies
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
Turing Machines – Decidability Lecture 25 Section 3.1 Fri, Oct 19, 2007.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
Lecture 18. Unsolvability Before the 1930’s, mathematics was not like today. Then people believed that “everything true must be provable”. (More formally,
Copyright © Curt Hill Quantifiers. Copyright © Curt Hill Introduction What we have seen is called propositional logic It includes.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12- Completeness Proof; Self References and Paradoxes 16 th August,
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.
1 Introduction to Abstract Mathematics Proofs in Predicate Logic , , ~, ,  Instructor: Hayk Melikya Purpose of Section: The theorems.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
Chapter 2 With Question/Answer Animations. Section 2.1.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Properties of Sets Lecture 26 Section 5.2 Tue, Mar 6, 2007.
Basic Definitions of Set Theory Lecture 23 Section 5.1 Wed, Mar 8, 2006.
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.
Basic Definitions of Set Theory Lecture 24 Section 5.1 Fri, Mar 2, 2007.
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
Based on slides by Patrice Belleville and Steve Wolfman CPSC 121: Models of Computation Unit 11: Sets.
321 Section Natalie Linnell. The importance of domains Domain is part of the function definition A predicate is a function from some domain to {T,F} If.
 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.
Basic Definitions of Set Theory Lecture 23 Section 5.1 Mon, Feb 21, 2005.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
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.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
3.1 Indirect Proof and Parallel Postulate
COT 3100, Spring 2001 Applications of Discrete Structures
321 Section, 2-7 Natalie Linnell.
Set Theory A B C.
CS201: Data Structures and Discrete Mathematics I
Direct Proof and Counterexample I
Introduction to Predicates and Quantified Statements II
Follow me for a walk through...
Statements Containing Multiple Quantifiers
PHIL 2000 Tools for Philosophers 1st Term 2016
Introduction to Predicates and Quantified Statements I
Mathematical Induction I
Lecture 43 Section 10.1 Wed, Apr 6, 2005
Direct Proof and Counterexample I
One-to-One and Onto, Inverse Functions
Follow me for a walk through...
One-to-One and Onto, Inverse Functions
CS201: Data Structures and Discrete Mathematics I
Follow me for a walk through...
Presentation transcript:

Russell’s Paradox Lecture 24 Section 5.4 Fri, Mar 10, 2006

Russell’s Paradox Let A be any set that you have ever seen. Then, most likely, A  A. For example A set of integers is not itself an integer. A set of rectangles is not itself a rectangle. A set of points in the plane is not itself a point in the plane. Is it possible that A  A for some set A?

Russell’s Paradox Let S = {A | A  A}. Let P(x) be the predicate “x  x.” Is S  S? If S  S, then S satisfies the predicate. So P(S) is true. But P(S) says that S  S.

Russell’s Paradox If S  S, then S does not satisfy the predicate. So P(S) is false But that means that S  S. Therefore, “S  S” is neither true nor false. This is a paradox.

The Barber Paradox In a certain town, there is a barber who cuts the hair of every person (them and only them) in the town who does not cut his own hair. Question: Who cuts the barber’s hair?

The Bibliography Paradox An author writes a book about bibliographies. He decides to list in the bibliography of this book all books that do not list themselves in their own bibliographies. Should he list his own book?

The Title Paradox Now the author decides to title his book The Title of of this Book Contains Two Errors

An Interesting “Theorem” Theorem: This theorem has no proof. Can you prove this theorem? Is this theorem true? If this theorem were false, then it would have a proof. But you can’t prove a false theorem. Therefore, it must be true. But doesn’t that argument constitute a proof that the theorem is true?

The Berry Paradox Consider the set A of all positive integers that can be described using fifty English words or less. “one” “the square of eleven” “the millionth prime” “the millionth prime times the billionth prime, plus ten”

The Berry Paradox Let B = N – A. That is, B is the set of all positive integers that cannot be described using fifty English words or less. B is not empty. (Why?) What is the smallest number in B? It is called the Berry number, after G. G. Berry, an Oxford University librarian.

The Berry Paradox Whatever the Berry number is, it is “the smallest positive integer that cannot be described using fifty English words or less.” But that description itself uses less than 50 English words and it describes that number. See The Berry Paradox.The Berry Paradox