Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.

Slides:



Advertisements
Similar presentations
Discrete Math Methods of proof 1.
Advertisements

The Logic of Quantified Statements
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
DISCRETE MATHEMATICS I LECTURES CHAPTER 3 Dr. Adam P. Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr.
CS128 – Discrete Mathematics for Computer Science
Discrete Mathematics Lecture 2 Logic of Quantified Statements,
Discrete Structures Chapter 1 Part B Fundamentals of Logic Nurul Amelina Nasharuddin Multimedia Department 1.
Predicate Calculus Subject / Predicate John / went to the store. The sky / is blue. Propositional Logic - uses statements Predicate Calculus - uses predicates.
Copyright © Cengage Learning. All rights reserved.
Discrete Structures Chapter 3: The Logic of Quantified Statements
Ch 1.3: Quantifiers Open sentences, or predicates, are sentences that contain one or more variables. They do not have a truth value until variables are.
Quantifiers and Negation Predicates. Predicate Will define function. The domain of a function is the set from which possible values may be chosen for.
Harper Langston New York University Summer 2015
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Copyright © Curt Hill Rules of Inference What is a valid argument?
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.
Chapter 2 The Logic of Quantified Statements. Section 2.4 Arguments with Quantified Statements.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Mathematical Preliminaries (Hein 1.1 and 1.2) Sets are collections in which order of elements and duplication of elements do not matter. – {1,a,1,1} =
Predicates and Quantified Statements M , 3.2.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Arguments with Quantified Statements M Universal Instantiation If some property is true for everything in a domain, then it is true of any particular.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Predicates and Quantified Statements
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
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.
Discrete Mathematics CS 2610 August 22, Agenda Last class Propositional logic Logical equivalences This week Predicate logic & rules of inference.
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
1 CMSC 250 Chapter 2, Predicate Logic. 2 CMSC 250 Definitions l Subject / predicate John / went to the store. The sky / is blue. l Propositional logic-
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Dilemma: Division Into Cases Dilemma: p  q p  r q  r  r Premises:x is positive or x is negative. If x is positive, then x 2 is positive. If x is negative,
Arguments with Quantified Statements Lecture 10 Section 2.4 Thu, Jan 27, 2005.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Introduction to Predicates and Quantified Statements I Lecture 9 Section 2.1 Wed, Jan 31, 2007.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Discrete Mathematics Lecture 2 Continuing Logic, Quantified Logic, Beginning Proofs Harper Langston New York University Summer 2016.
Harper Langston New York University Summer 2017
3. The Logic of Quantified Statements
Arguments with Quantified Statements
3. The Logic of Quantified Statements Summary
Chapter 3 The Logic of Quantified Statements
Negations of Quantified Statements
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS.
The Foundations: Logic and Proofs
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Introduction to Predicates and Quantified Statements I
Predicates and Quantifiers
Discrete Mathematics Lecture 4 Logic of Quantified Statements
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Presentation transcript:

Discrete Mathematics Lecture 2 Alexander Bukharovich New York University

Predicates A predicate is a sentence that contains a finite number of variables and becomes a statement when specific values are substituted for the variables The domain of a predicate variable is a set of all values that may be substituted in place of the variable P(x): x is a student at NYU

Predicates If P(x) is a predicate and x has domain D, the truth set of P(x) is the set of all elements in D that make P(x) true when substituted for x. The truth set is denoted as: {x  D | P(x)} Let P(x) and Q(x) be predicates with the common domain D. P(x)  Q(x) means that every element in the truth set of P(x) is in the truth set of Q(x). P(x)  Q(x) means that P(x) and Q(x) have identical truth sets

Universal Quantifier Let P(x) be a predicate with domain D. A universal statement is a statement in the form “  x  D, P(x)”. It is true iff P(x) is true for every x from D. It is false iff P(x) is false for at least one x from D. A value of x form which P(x) is false is called a counterexample to the universal statement Examples –D = {1, 2, 3, 4, 5}:  x  D, x² >= x –  x  R, x² >= x Method of exhaustion

Existential Quantifier Let P(x) be a predicate with domain D. An existential statement is a statement in the form “  x  D, P(x)”. It is true iff P(x) is true for at least one x from D. It is false iff P(x) is false for every x from D. Examples: –  m  Z, m² = m –E = {5, 6, 7, 8, 9},  x  E, m² = m

Universal Conditional Quantifier Universal conditional statement “  x, if P(x) then Q(x)”: –  x R, if x > 2, then x 2 > 4 Empty domains: all balls in the bowl are blue Universal conditional statement is called vacuously true or true by default iff P(x) is false for every x in D

Negation of Quantified Statements The negation of a universally quantified statement  x  D, P(x) is  x  D, ~P(x) The negation of an existentially quantified statement  x  D, P(x) is  x  D, ~P(x) The negation of a universal conditional statement  x  D, P(x)  Q(x) is  x  D, P(x)  ~Q(x)

Exercises Write negations for each of the following statements: –All dinosaurs are extinct –No irrational numbers are integers –Some exercises have answers –All COBOL programs have at least 20 lines –The sum of any two even integers is even –The square of any even integer is even Let P(x) be some predicate defined for all real numbers x, let: r =  x  Z, P(x); s =  x  Q, P(x); t =  x  R, P(x) –Find P(x) (but not x  Z) so that r is true, but s and t are false –Find P(x) so that both r and s are true, but t is false

Multiply Quantified Statements For all positive numbers x, there exists number y such that y < x There exists number x such that for all positive numbers y, y < x For all people x there exists person y such that x loves y There exists person x such that for all people y, x loves y Definition of mathematical limit

Negation of Multiply Quantified Statements The negation of  x,  y, P(x, y) is logically equivalent to  x,  y, ~P(x, y) The negation of  x,  y, P(x, y) is logically equivalent to  x,  y, ~P(x, y)

Necessary and Sufficient Conditions, Only If  x, r(x) is a sufficient condition for s(x) means:  x, if r(x) then s(x)  x, r(x) is a necessary condition for s(x) means:  x, if s(x) then r(x)  x, r(x) only if s(x) means:  x, if r(x) then s(x)

Prolog Programming Language Simple statements: isabove(g, b), color(g, gray) Quantified statements: if isabove(X, Y) and isabove(Y, Z) then isabove(X, Z) Questions: ?color(b, blue), ?isabove(X, w)

Exercises Rewrite  !x  D, P(x) without using the symbol  ! Determine whether a pair of quantified statements have the same truth values –  x  D, (P(x)  Q(x)) vs (  x  D, P(x))  (  x  D, Q(x)) –  x  D, (P(x)  Q(x)) vs (  x  D, P(x))  (  x  D, Q(x)) –  x  D, (P(x)  Q(x)) vs (  x  D, P(x))  (  x  D, Q(x)) –  x  D, (P(x)  Q(x)) vs (  x  D, P(x))  (  x  D, Q(x))

Arguments with Quantified Statements Rule of universal instantiation: if some property is true of everything in the domain, then this property is true for any subset in the domain Universal Modus Ponens: –Premises: x, if P(x) then Q(x); P(a) for some a –Conclusion: Q(a) Universal Modus Tollens: –Premises: x, if P(x) then Q(x); ~Q(a) for some a –Conclusion: ~P(a) Converse and inverse errors

Validity of Arguments using Diagrams Premises: All human beings are mortal; Zeus is not mortal. Conclusion: Zeus is not a human being Premises: All human beings are mortal; Felix is mortal. Conclusion: Felix is a human being Premises: No polynomial functions have horizontal asymptotes; This function has a horizontal asymptote. Conclusion: This function is not a polynomial

Exercises Derive the rule of universal modus tollens