CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

Extensible Networking Platform CSE 240 – Logic and Discrete Mathematics Review: Mathematical Induction Use induction to prove that the sum of the.
Prof. Johnnie Baker Module Basic Structures: Sets
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
(CSC 102) Discrete Structures Lecture 14.
Theory of Computation 1 Theory of Computation Peer Instruction Lecture Slides by Dr. Cynthia Lee, UCSD are licensed under a Creative Commons Attribution-NonCommercial-ShareAlike.
Russel‘s paradox (also known as Russel‘s antimony)
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Elementary Number Theory and Methods of Proof
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE115/ENGR160 Discrete Mathematics 02/07/12
Sets 1.
Sets 1.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Quantifiers and Negation Predicates. Predicate Will define function. The domain of a function is the set from which possible values may be chosen for.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
Methods of Proof & Proof Strategies
CSCI 2110 Discrete Mathematics Tutorial 10 Chin 1.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
CompSci 102 Discrete Math for Computer Science
Predicates and Quantified Statements
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
CSE 311 Foundations of Computing I Lecture 9 Proofs and Set Theory Autumn 2012 CSE
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
Chapter 2 With Question/Answer Animations. Section 2.1.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
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.
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
1 CMSC 250 Chapter 3, Number Theory. 2 CMSC 250 Introductory number theory l A good proof should have: –a statement of what is to be proven –"Proof:"
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2011 CSE 3111.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2012 CSE
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.
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Chapter 1 Logic and Proof.
11.7 – Proof by Mathematical Induction
CS 2210:0001 Discrete Structures Logic and Proof
CSE 311 Foundations of Computing I
CSE15 Discrete Mathematics 01/23/17
Direct Proof by Contraposition Direct Proof by Contradiction
CSE 105 Theory of Computation
Chapter 1: The Foundations: Logic and Proofs
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Mathematics for Computer Science MIT 6.042J/18.062J
CSE 311: Foundations of Computing
Follow me for a walk through...
First Order Logic Rosen Lecture 3: Sept 11, 12.
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Foundations of Discrete Mathematics
Presentation transcript:

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett

Today’s Topics: 1. Predicate Quantifiers 2. Domain 3. Paradoxes 2

1. Predicate Quantification Sometimes and all the time. 3

I’m going to assume you know this from the reading: 4

We’re going to focus on:  “Nested” quantifiers/more than one quantifier  General strategy for proving (or disproving) quantified statements 5

Which picture represents the predicate? (Predicate Love(x,y) means “x loves y”, denoted by arrow from x to y)  ssss 6 A. D. None/more/other B.C.

Which picture represents the predicate? (Predicate Love(x,y) means “x loves y”, denoted by arrow from x to y) 7 A. D. None/more/other B.C. 

Proof strategies overview (more coming later in the quarter)  For a universally quantified (“for all”) statement:  To prove it:  Mathematical induction, direct proof, generalization from the generic particular (construction)  To disprove it:  Provide a single counterexample  For an existentially quantified (“there exists”) statement:  To prove it:  Provide a single example  To disprove it:  State the correct version as a universally quantified statement (“For all x, not P(x)”) then prove it using above methods 8

How could we disprove the predicate? (Predicate Love(x,y) means “x loves y”) 9

What is the correct negation of the predicate? (Predicate Love(x,y) means “x loves y”) 10

2. Domain Know thy universe 11

In which domain is the following true?   x  y.x  y A. All real numbers. B. All integers. C. All real numbers less than or equal to 5. D. All real numbers greater than or equal to 5.

In which domain is the following true?   x  y.x=y 2 A. Integers B. Fruits C. {0,1} D. {1,2} E. None/other/more than one

In which domain is the following true?   x  y  z.x=yz A. Integers B. Fruits C. {0,1} D. {1,2} E. None/other/more than one

Common number systems we will encounter in this class  Integers = …,-3,-2,-1,0,1,2,3,…  Even, Odd  Naturals = 1,2,3…  Rationals = numbers which can be written as p/q, where p,q are integers (1/2, -2/3, 4/13,…)  Non-rationals = Numbers which are not rationals (e, ,…)

In which domain is the following true?  All cows are white A. USA B. England C. France D. This room E. None/other/more than one

3. Contradiction and Paradox Q: Do you like CSE 20? A: Yes and no. 17

Is this sentence true? “This sentence is false.” a) TRUE b) FALSE 18

Liar’s Paradox  “This sentence is false.”  This has been perplexing people since at least the Greeks in 4 th century BCE (2300 years!)  What are some key features of this that make it a paradox? 19

Is this sentence true? “This sentence is true.” a) TRUE b) FALSE 20

Grandparent Paradox (Time Travel Paradox)  You travel back in time and prevent one pair of your biological grandparents from ever meeting each other (assume this prevents your birth).  Now who will go back in time to prevent your grandparents from meeting?  Pop culture version: 21

Pinocchio’s Paradox 22

The Barber  A certain town has only one barber (a man). Every man in the town is clean-shaven. For each man m in the town, the barber shaves m if and only if m does not shave himself.  Question: Does the barber shave himself? a) YES b) NO c) Not enough information d) Other 23

List Organization Question (aka Russell’s paradox)  Suppose you have many lists and some of your lists are lists of lists (to help you organize your lists), and some lists even include themselves.  You make a list of all lists that do not include themselves, called NON-DANGER-LIST.  Question:  Should NON-DANGER-LIST include itself? a) YES b) NO c) Not enough information d) Other 24