Recall that the expression x > 3 is not a proposition. Why?

Similar documents
Section Summary. Section 1.5 9/9/2014

Predicate Calculus lecture 1

Propositional Logic Not Enough

Predicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

Solutions to Sample Problems for Midterm

Logical equivalences 12/8/2015. S T: Two statements S and T involving predicates and quantifiers are logically equivalent

Introduction to Sets and Logic (MATH 1190)

Introduction to Decision Sciences Lecture 2

Mat 243 Exam 1 Review

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

Section 2.1: Introduction to the Logic of Quantified Statements

Predicate Logic. Predicates. Math 173 February 9, 2010

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.

Discrete Structures Lecture 5

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Thinking of Nested Quantification

Proposi'onal Logic Not Enough

Math 3336: Discrete Mathematics Practice Problems for Exam I

Lecture Predicates and Quantifiers 1.5 Nested Quantifiers

Discrete Structures Lecture Predicates and Quantifiers

Lecture 3. Logic Predicates and Quantified Statements Statements with Multiple Quantifiers. Introduction to Proofs. Reading (Epp s textbook)

ICS141: Discrete Mathematics for Computer Science I

Predicate in English. Predicates and Quantifiers. Predicate in Logic. Propositional Functions: Prelude. Propositional Function

Chapter 2: The Logic of Quantified Statements. January 22, 2010

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

CSI30. Chapter 1. The Foundations: Logic and Proofs Nested Quantifiers

1 Predicates and Quantifiers

1.1 Language and Logic

MATH 2001 MIDTERM EXAM 1 SOLUTION

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Math 10850, fall 2017, University of Notre Dame

Logic. Def. A Proposition is a statement that is either true or false.

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Predicate Logic. Andreas Klappenecker

Statements and Quantifiers

Today s Lecture. ICS 6B Boolean Algebra & Logic. Predicates. Chapter 1: Section 1.3. Propositions. For Example. Socrates is Mortal

First-Order Logic (FOL)

Announcements CompSci 102 Discrete Math for Computer Science

Discrete Mathematics and Its Applications

THE LOGIC OF QUANTIFIED STATEMENTS

Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science

Quantifiers. P. Danziger

Predicate Calculus - Syntax

Solutions to Problem Set 1

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

Chapter 2: The Logic of Quantified Statements

STRATEGIES OF PROBLEM SOLVING

We have seen that the symbols,,, and can guide the logical

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Predicate Logic Thursday, January 17, 2013 Chittu Tripathy Lecture 04

Predicates and Quantifiers. Nested Quantifiers Discrete Mathematic. Chapter 1: Logic and Proof

CSE 20. Final Review. CSE 20: Final Review

Basic Logic and Proof Techniques

1.1 Language and Logic

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Quantifiers. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, 2018

Chapter 1 Elementary Logic

2-4: The Use of Quantifiers

Logic Overview, I. and T T T T F F F T F F F F

Section Summary. Predicates Variables Quantifiers. Negating Quantifiers. Translating English to Logic Logic Programming (optional)

CSE 1400 Applied Discrete Mathematics Definitions

1. From Lewis Carroll: extract a pair of premises and finish the conclusion.

With Question/Answer Animations. Chapter 2

Discrete Mathematics. Instructor: Sourav Chakraborty. Lecture 4: Propositional Logic and Predicate Lo


Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Transparencies to accompany Rosen, Discrete Mathematics and Its Applications Section 1.3. Section 1.3 Predicates and Quantifiers

Section 2.3: Statements Containing Multiple Quantifiers

Discrete Structures for Computer Science

Math.3336: Discrete Mathematics. Nested Quantifiers

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Some Review Problems for Exam 1: Solutions

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

For all For every For each For any There exists at least one There exists There is Some

DISCRETE MATHEMATICS BA202

Discrete Mathematics

AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold

G52DOA - Derivation of Algorithms Predicate Logic

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

1.3 Predicates and Quantifiers

MTH 299 In Class and Recitation Problems SUMMER 2016

Math 13, Spring 2013, Lecture B: Midterm

THE PREDICATE CALCULUS

Intro to Logic and Proofs

Background for Discrete Mathematics

CS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks

2 Truth Tables, Equivalences and the Contrapositive

Predicate Logic: Sematics Part 1

Quantifiers and Statements

Predicates, Quantifiers and Nested Quantifiers

CS156: The Calculus of Computation Zohar Manna Winter 2010

Introduction to first-order logic:

Foundations of Mathematics Worksheet 2

THE LOGIC OF QUANTIFIED STATEMENTS

Lecture : Set Theory and Logic

Logic and Propositional Calculus

Transcription:

Predicates and Quantifiers Predicates and Quantifiers 1 Recall that the expression x > 3 is not a proposition. Why? Notation: We will use the propositional function notation to denote the expression " x has property P". As soon as x is assume to be some value then has a truth value. The goal of the section is to quantify such statements so that the result is a proposition. The process is very much in the spirit of the next example. Example: Let denote the statement "x > 3". What are the truth values: i. 4) True or False? ii. 2) True or False? iii. True or False? Example: Let Q( denote the statement "x = y + 3". What are the truth values: i. Q(7,4) True or False? ii. Q(2,2) True or False? Quantifiers Def. The universe of discourse for a math statement is the domain of that statement. Def. The universal quantification of is the proposition " is true for all values of x in the universe of discourse." This proposition is denoted by x. The proposition x is read as "for all x " or "for every x ". The symbol is called the universal quantifier. Def. The existential quantification of is the proposition " There exists an element x in the universe of discourse for which is true." This proposition is denoted by x. The symbol is called the existential quantifier. The proposition x is read as "for some x " or "there exists an x such that ".

The Truth Values of x and x Predicates and Quantifiers 2 Example 1: Suppose that the universe of discourse for x is the set of nonnegative integers {0, 1, 2, 3, 4, 5, } What is the truth value of x (x > 0)? What is the truth value of x (x > 0)? Example 2: Suppose that the universe of discourse for is the small set { x 1, x 2, x 3, x 4 }. Since x x 1 ) x 2 ) x 3 ) x 4 ) when is x true when is x false Since x x 1 ) x 2 ) x 3 ) x 4 ) when is x true when is x false Note: The above observations also hold for infinite universe of discourse sets. Examples 3: Where denotes: Universe of Discourse for x =x+ 3 Real numbers x =x+ 0 Real numbers 0/x = 0 Integers 0 - x = x Positive Integers 0 - x = x Natural numbers Truth value of x Truth value of x Example 4: (i) What is the truth value of [ x x (ii) What is the truth value of [ x x

Predicates and Quantifiers 3 Example 5: Let denote the statement "x 2 =y". Suppose that the universe of discourse is the set of real numbers. Which of the following is the English equivalent to y x (a) For every real number y there is a real number x such (b) For every real number y and for every real number x it is the case (c) There is a real number y such that for every real number x it is the case What is the truth value of y x? Example 6: Let denote the statement " x 2 =y ". Suppose that the universe of discourse is the set of real numbers. Which of the following is the English equivalent to y x? (a) For every real number y there is a real number x such (b) For every real number y and for every real number x it is the case (c) There is a real number y such that for every real number x it is the case What is the truth value of y x? Definition. A real number x is a rational number if can be expressed as the a ratio of two integers a and b with b not zero, that is if x =, with b 0. b Example 7: Let Q( denote the statement " x is a rational number ", and I( denote the statement " y is an Assume the universe of discourse is the set of real numbers. i. y (Q( I() Which of the following is the English translation? (a) There is a rational number y which is a rational number and also an (b) There is a real number y which is a rational number and also an (c) Every real number y is a rational and also an

ii. y (Q( I() Predicates and Quantifiers 4 Which of the following is the English translation? (a) There is a rational number y which is a rational number and also an (b) There is a real number y which is a rational number and also an (c) Every real number y is a rational or it is an (d) Every real number y is a rational and also an iii. y (I( Q() Which of the following is the English translation? (a) Every real number y is an integer and also a rational number. (b) There is a real number y such that if y is an integer then y is a rational number. (c) For any real number y, if y is an integer then y is a rational number. iv. y ( I( Q() What is the English translation v. y (Q( I() What is the English translation Example 8: Assume the universe of discourse is the set of all students at UHD. Let C( be " x has a computer" and let F( be " x and y are friends." i. Translate C(Jud into English. ii. Which is the English translation of y( C( Judy, ). (a) Judy has a friend who has a computer. (b) Judy has a computer and a friend. (c) There is a student who has a friend and a computer. iii. Translate C( Jud y( C( Judy, ) into English.

Predicates and Quantifiers 5 iv. Translate x( C( y( C( ) into English. v. Which of the symbolic logic propositions is equivalent to the sentence " There is a student at UHD who is friends with every UHD student." (a) x C( (c) y x F( (b) y F( (b) y x F( vi. vii. Which of the symbolic logic propositions is equivalent to the sentence " There is a student at UHD who is friends with only one other UHD student." x y ( x (a) [ (b) x y z [( x [( y z) F( z) (c) x y z [( x [( y z) F( z) Which of the symbolic logic propositions is equivalent to the sentence " If a UHD student has a friend then the friend has a computer." x y F( C( (a) [ (b) x y [ F( C( (c) x y [ F( C( viii. Express the sentence in terms of C(, F(, logical connectives and quantifiers. " There is a student at UHD who is friends with every UHD student who has a computer." Example 9: Assume the universe of discourse is the set of elements a set U. Let A and B be subsets of U. A function from A to B is one-to-one if for every a and b in A, a=b whenever f(a) = f(b). i) Express the definition in terms of logical connectives and quantifiers. ii) Using part i) explain when a function is not one-to-one.

Negations of Quantified Expressions Predicates and Quantifiers 6 Example 10: Consider the proposition " Every student in the class has taken a course in calculus." When is this proposition true Write the proposition in symbolic logic notation. Which of the following is the negation of "Every student in the class has taken a course in calculus." (a) No student in the class has taken calculus. (b) Some students in the class have not taken calculus (c) Some student in the class has not taken calculus Write the negation of the proposition in symbolic logic notation. When is the negation of the proposition "Every student in the class has taken a course in calculus" true Fact: xp ( x xp ( x Example 11: (iii) What is the truth value of [ xp ( [ x (iv) What is the truth value of [ xp ( [ x (v) What is the truth value of [ xp ( [ x Example 12: Write a statement equivalent to y x( Q( ) so that the negation appears only within predicates (i.e. not in front of quantifiers.)