ACULA, D.

(MATH 102C, USTENG'G ICS)

04/28/12

Predicate Logic is an extension of Propositional Logic. It was used to express the meaning of wide range of statements in mathematics and computer science in ways that permit us to reason and explore relationships between objects

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

Suppose we have the ff statements: x+ 7 = 8 y+3<5 Company x was attacked by the hackers. Note: the above statement can neither be true nor false when the values of the variables are not specified. These statements have TWO PARTS *The variable x, y etc. (subject of the statement) *The predicate (refers to a property that the subject of the statement can
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12

x= 8 S: x P: is equal to eight y+3<5 S: y + 3 P: is less than 5 Company x was attacked by the hackers. S: Company x P: was attacked by the hackers.
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12 4

Let P(x) be a statement involving the variable x and let D be a set. We call P a PROPOSITIONAL FUNCTION (wrt D) if for each x in D, P(x) is a PROPOSITION. We call D the DOMAIN OF DICOURSE.

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

Let: P(x) : x + 2x2 is a rational numbers. D: set of rational numbers P(x) : The students scored perfect in the test. D: set of students

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

Determine the truth values of the ff. statements (1)P(x) : 3x + 5 < 3 ; P(2), P(4)
(1)P(x, (1)P(x,

y) : 2x 3y = 4 ; P(0, 1) , P(6, 1) y, z) : x y < z ; P(1, 1,1), P(2, -1, 0)

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

QUANTIFICATION used to create a proposition from a propositional function. It expresses the extent to which a predicate is true over a range of elements. TWO TYPES OF QUANTIFICATION (1)UNIVERSAL QUANTIFICATION (2)EXISTENTIAL QUANTIFICATION
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12 8

Let P(x) be a proposition function with domain of discourse D. The statement for every x, P(x) is said to be UNIVERSALL QUANTIFIED STATEMENT. The symbol (universal quantifier) means for every or for All The statement for all x, P(x) can be written as xP(x). The statement for all x, P(x) is TRUE if P(x) is true for every x in D. The statement for all x, P(x) is FALSE if P(x) is false for at least one x in D.
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12 9

(1)

Let P(x) x + 2 < 2. What is the truth value of the quantification xP(x), where the domain consist of all non-negative integers? What is the truth value of xP(x), where P(x) is the statement x2 < 9 and the domain consists of the positive integers not exceeding 3?
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12 10

(1)

Let P(x) be a proposition function with domain of discourse D. The statement for some x, P(x) is said to be EXISTENTIALLY QUANTIFIED STATEMENT. The symbol (existential quantifier) means for some or there Exists. The statement for some x, P(x) can be written as xP(x). The statement for some x, P(x) is TRUE if P(x) is true for at least one x in D. The statement for some x, P(x) is FALSE if P(x) is false for every x in D>
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12 11

(1)

Let P(x) x + 2 < 2. What is the truth value of the quantification xP(x), where the domain consist of all non-negative integers? What is the truth value of xP(x), where P(x) is the statement x2 < 9 and the domain consists of the positive integers not exceeding 3?

(1)

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

12

UNIQUENESS QUANTIFIER
The statement There exists a unique x such that P(x) is true or there is exactly one or there is one and only one is an example of quantification using UNIQUENESS QUANTIFIER. And this can be written as !xP(x).

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

13

The quantifiers and have higher precedence than all logical operations. Example. (1) The conjunction of xP(x) and Q(x) : ( xP(x)) Q(x) rather than x(P(x) Q(x)).

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

14

The occurrence of the variable is said to be BOUND when the quantifier is used on the variable. The occurrence of the variable that is not bound by a quantifier is said to be FREE. The part of a logical expression to which a quantifier is applied called the SCOPE of quantifier.
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12 15

x(4x + 4y <2z) Bound: x (by universal quantifier) Free: y & z (1) x(P(x) Q(x)) xR(x) Bound: all variables Free: d.n.e.
(1)

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

16

Statements involving predicates and quantifiers are LOGICALLY EQUIVALENT if and only if they have the same truth value no matter which predicates are substituted into these statements and which domain of discourse is used for the variables in these propositional functions.
ACULA, D. (MATH 102C, UST-ENG'G ICS) 04/28/12 17

(1) Show that x(P(x) Q(x)) xP(x) Q(x (2)Show that x(P(x) Q(x)) xP(x) Q(x)

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

18

NEGATION EQUIVALENTWHEN IS STATEMENT NEGATION TRUE?

WHEN IS NEGATION FALSE?

xP(x) xP(x) For every x, There is an x P(x) is false for which P(x) is true. xP(x) xP(x) There is an P(x) is true for x for which every x. P(x) is false. Note: The rules for negations for quantifiers are called DE MORGANS LAWS FOR QUANTIFIERS
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12

19

SHOW THAT x(P(x) Q(x)) x(P(x) Q(x).

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

20

TWO-PLACE PREDICATES are referred to as relational predicates, they express a relation between two components. Let P = is easier than xP(x, y): Some x is easier than y. yP(x,y): Every y is easier than x.

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

21

Two quantifiers are NESTED if one quantifier is within the scope of the other quantifier. EXAMPLE xy((x<0)(y<0))(xy < 0) Consider that the domain of discourse for both variables are real numbers. For all real number x and for all real number y, if x is less than 0 or y less than 0, then xy is less than 0.

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

22

It is important to note that the order of the quantifier important, unless all the quantifiers are universal(existential) quantifiers. Let P(x, y): 2xy = 3x + y What are the truth values of xyP(x, y) yxP(x, y) xyP(x, y) xyP(x, y) xyP(x, y) yxP(x, y) Where the domain for all variables consists of all real numbers
ACULA, D. (MATH 102C, USTENG'G ICS) 04/28/12 23

STATEMENT WHEN TRUE? x yP(x, y) y xP(x, y) x yP(x, y) x yP(x, y) x yP(x, y) P(x, y) is true for every pair x, y.

WHEN FALSE? There is a pair x, y for which P(x, y) is false.

For every x, there There is an x such that is a y for which P(x, P(x, y) is false for y) is true. every y. There is an x for which P(x, y) is true for every y. For every x there is a y for which P(x, y) is false.
24

There is pair x, y P(x, y) is false for ACULA, D. (MATH 102C, USTfor which P(x, y) is every x, y. ENG'G ICS) 04/28/12

Discrete Math Book

ACULA, D. (MATH 102C, USTENG'G ICS)

04/28/12

25