Predicates and Quantified Statements

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

Discrete Math Methods of proof 1.
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Analytical Methods in CS (CIS 505)
Discrete Structures Chapter 1 Part B Fundamentals of Logic Nurul Amelina Nasharuddin Multimedia Department 1.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
Discrete Mathematics Math 6A Instructor: M. Welling.
Chapter 3: The Logic of Quantified Statements 3.2 Predicates and Quantified Statements II 1 TOUCHSTONE: Stand you both forth now: stroke your chins, and.
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.
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
Quantifiers and Negation Predicates. Predicate Will define function. The domain of a function is the set from which possible values may be chosen for.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 11 Introduction to Predicate Logic Limitations of Propositional Logic Predicates, quantifiers and propositions.
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
MATH 224 – Discrete Mathematics
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
CS 103 Discrete Structures Lecture 05
(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Chapter 2 The Logic of Quantified Statements. Section 2.4 Arguments with Quantified Statements.
Predicates and Quantified Statements M , 3.2.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
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.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Statements with Multiple Quantifiers. When a statement contains more than one quantifier, we imagine the actions suggested by the quantifiers as being.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
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.
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
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-
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.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
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.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Harper Langston New York University Summer 2017
3. The Logic of Quantified Statements Summary
Predicates and Quantified Statements I
Chapter 3 The Logic of Quantified Statements
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Negations of Quantified Statements
Chapter 1 The Foundations: Logic and Proofs
Discrete Structure II: Introduction
The Foundations: Logic and Proofs
Copyright © Cengage Learning. All rights reserved.
CS 220: Discrete Structures and their Applications
Copyright © Cengage Learning. All rights reserved.
CHAPTER 1: LOGICS AND PROOF
Introduction to Predicates and Quantified Statements I
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Copyright © Cengage Learning. All rights reserved.
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
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:

Predicates and Quantified Statements x is an even number x is a student in Discrete Math x+y=5 x is the son of z These are not statements. Why? When the variable(s) takes specific values, they become propositions. The sets were the variable takes values is called the domain D. Each sentence describe properties hold by the variable(s) involve in it. These sentences are called Predicates or Open Statements.

Notation for Predicates P(x): x is an even number Possible domains: N, Z, R Q(y): y is a student in Discrete Math Possible domains: TAMUCC, College of Science R(x, y): x + y =5 Possible domains: N, Z, Q, R S(x, z): x is the son of z Possible domains: People in CC, TX, USA, the world

True Set P(x): x is an even number If D is the domain, represents all the elements in the domain that make P(x) true. If D={1,2,3,4} The true set is { 2,4} If D=N, the true set is {0,2,4,6,8,…}

Let Q(n) be the predicate “n is a factor of 8 Let Q(n) be the predicate “n is a factor of 8.” Find the truth set of Q(n) if the domain of n is the set Z+ of all positive integers {1, 2, 4, 8} b. the domain of n is the set Z of all integers. {1, 2, 4, 8,−1,−2,−4,−8}

Quantifiers Consider P(x): x is an even number with domain all integers How to make a predicate a proposition? By substituting the variable by a specific value: P(3), P(4), etc. All integers satisfy P(x) Some integers satisfy P(x)

P(x): x is an even number To make a predicate into a proposition two components are needed: the quantifier and the domain (where the variable takes values) P(x): x is an even number All integers satisfy P(x) Quantifiers Domain Some integers satisfy P(x)

P(x): x is an even number Equivalent Expressions for “All” P(x): x is an even number All integers satisfy P(x) for every x, P(x) for arbitrary x, P(x) for any x, P(x) for each x, P(x) given any x, P(x) Let D = {1, 2, 3, 4, 5}, and consider the statement Show that this statement is true. Let D = {-1, 0.25, 0.5, 1}, and consider the statement Show that this statement is false. (counterexample)

P(x): x is an even number Equivalent Expressions for “Some” P(x): x is an even number Some integers satisfy P(x) there is an a, P(a), we can find a, P(a), there is at least one a, P(a) for some a, P(a), for at least one a, P(a) Let D = {-1, 0.25, 0.5, 1}, and consider the statement Show that this statement is false.

From Formal to Informal Rewrite the following formal statements in a variety of equivalent but more informal ways. Do not use the symbol ∀ or ∃. a. b. c.

Solutions a. All real numbers have nonnegative squares. Or: Every real number has a nonnegative square. Or: Any real number has a nonnegative square. Or: The square of each real number is nonnegative. b. All real numbers have squares that are not equal to −1. Or: No real numbers have squares equal to −1. (The words none are or no . . . are are equivalent to the words all are not.)

c. There is a positive integer whose square is equal to itself c. There is a positive integer whose square is equal to itself. Or: We can find at least one positive integer equal to its own square. Or: Some positive integer equals its own square. Or: Some positive integers equal their own squares.

Rewrite the following statement informally, without quantifiers or variables. ∀x ∈ R, if x > 2 then x2 > 4. Solution: If a real number is greater than 2 then its square is greater than 4. Or: Whenever a real number is greater than 2, its square is greater than 4. Or: The square of any real number greater than 2 is greater than 4. Or: The squares of all real numbers greater than 2 are greater than 4.

Equivalent Forms of Universal and Existential Statements Observe that the two statements “∀ real numbers x, if x is an integer then x is rational” and “∀ integers x, x is rational” mean the same thing. Both have informal translations “All integers are rational.” In fact, a statement of the form can always be rewritten in the form by narrowing U to be the domain D consisting of all values of the variable x that make P(x) true.

Exercise Rewrite the statement "All squares are rectangles" in the two forms “∀x, if ______ then ______” and “∀ ______x, _______” Solution: ∀x, if x is a square then x is a rectangle. ∀ squares x, x is a rectangle.

On the other hand, a statement of the form “∃x such that P(x) and Q(x)” can be rewritten as “∃x εD such that Q(x),” where D is the set of all x for which P(x) is true.

A statement of the form “∃x such that P(x) and Q(x)” can be rewritten as “∃x εD such that Q(x),” where D is the set of all x for which P(x) is true.

A prime number is an integer greater than 1 whose only positive integer factors are itself and 1. Consider the statement “There is an integer that is both prime and even.” Let P (n) be “n is prime” and E(n) be “n is even.” Use the notation P (n) and E (n) to rewrite this statement in the following two forms: a. ∃n such that ______ ∧ ______ . b. ∃ ______ n such that ______.

NEGATION OF “ALL” “SOME” All the students in Discrete Math are math majors Statement in symbolic form Let D be the Discrete Math students, M(x): x is a math major Negation of the original statement Some discrete math students are not math majors Negation in symbolic form

Some students in Discrete Math wear glasses Statement in symbolic form D Discrete Math students, W(x): x wears glasses Negation of original statement Any Discrete Math student does not wear glasses Negation in symbolic form

SUMMARY OF NEGATIONS FOR "ALL " "SOME"

Contrapositive, Converse, Inverse of a Universal Implication Consider a statement of the form Contrapositive Converse Inverse

Example Write a formal and an informal contrapositive, converse, and inverse for the statement: If a real number is greater than 2, then its square is greater than 4.

Contrapositive: ∀x ∈ R, if x2 ≤ 4 then x ≤ 2 Contrapositive: ∀x ∈ R, if x2 ≤ 4 then x ≤ 2. If the square of a real number is less than or equal to 4, then the number is less than or equal to 2. Converse: ∀x ∈ R, if x2 > 4 then x > 2. If the square of a real number is greater than 4, then the number is greater than 2. Inverse: ∀x ∈ R, if x ≤ 2 then x2 ≤ 4. If a real number is less than or equal to 2, then the square of the number is less than or equal to 4.

Necessary, Sufficient, Only if For all x, P(x) is a sufficient condition for Q(x) For any x, Q(x) is a necessary condition for P(x) For any x, P(x) only if Q(x)

Example Rewrite the following statements as quantified conditional statements. Do not use the word necessary or sufficient. a. Squareness is a sufficient condition for rectangularity. b. Being at least 35 years old is a necessary condition for being President of the United States.

Solution a. A formal version of the statement is ∀x, if x is a square, then x is a rectangle. In informal language: If a figure is a square, then it is a rectangle. b. A formal version ∀ people x, if x is younger than 35, then x cannot be President of the United States. Or, by the equivalence between a statement and its contrapositive: ∀ people x, if x is President of the United States, then x is at least 35 years old. Informal version Any president of the United States is at least 35 years old