Scribd
Upload
8 views28 pages

Ex 1.4 Predicates and Quantifiers (Without Translation)

The document discusses predicates, quantifiers, and their role in logic, specifically in predicate calculus. It explains how predicates can become propositions through variable assignment and introduces universal and existential quantifiers, including their truth values and examples. Additionally, it covers the uniqueness quantifier, restricted domains, binding variables, and the scope and precedence of quantifiers.

Uploaded by

f2024065395
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
8 views28 pages

Ex 1.4 Predicates and Quantifiers (Without Translation)

The document discusses predicates, quantifiers, and their role in logic, specifically in predicate calculus. It explains how predicates can become propositions through variable assignment and introduces universal and existential quantifiers, including their truth values and examples. Additionally, it covers the uniqueness quantifier, restricted domains, binding variables, and the scope and precedence of quantifiers.

Uploaded by

f2024065395
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 28

1

Discrete Structures

Ayesha Asmat
[email protected]
Predicate
• a declarative sentence which contains one or
more variables,and is not a proposition,
• but becomes a proposition when the variables
in it are replaced by certain allowable choices
Predicates

Statements involving variables.


Example:
1. x > 3
2. x = y + 3
3. x + y = z
4. computer x is under attack by an intruder
Predicate
• x is greater than 3

x is greater than 3
sub predicate

• Denote by P(x)
• statement P(x) also known as propositional
function P at x.
Example(1 variable)
1. Let P(x) denote the statement “x > 3.” What
are the truth values of P(4) and P(2)?

P(4) : 4>3, True


P(2): 2>3, False
Example(more than 1 variable)
1. Let Q(x, y) denote the statement “x = y + 3.”
What are the truth values of the propositions
Q(1, 2) and Q(3, 0)?

Q(1, 2) : 1=2+3, False


Q(3, 0): 3=0+3 True
Universe of
Discourse
• Consider the example x > 3. Does it make
sense to assign to x the value “blue”?

Predicates become propositions once every


variable is bound by assigning it a value from
the Universe of Discourse “U” (aka domain)
Example

• Let U= Z, the integers = { . . -2, -1, 0 , 1, 2, . . .}


• P(x): x > 0 is the predicate.
propositions where x is assigned a value:
• P(-3)
• P(0)
• P(3)
Quantifiers
Another way to make a predicate into a
proposition is to quantify it. That is, the
predicate is true (or false) for all possible values
in the universe of discourse or for some value(s)
in the universe of discourse
• A quantifier is “an operator that limits the
variables of a proposition”
• Area of logic that deal with predicate and
quantifiers is called predicate calculus.
UNIVERSAL QUANTIFIER
• The universal quantification of a predicate P(x) is the proposition
“P(x) is true for all values of x in the universe of discourse

• notation ∀x P(x) which can be read “for all x”


(domain)”

An element for which P(x) is false is called a counterexample of ∀x


P(x)

• True
• When No False example found
• False
• When 1 False example found
Example 1

the truth value of the quantification ∀x


• Let P(x) be the statement “x + 1 > x.” What is

P(x), where the domain consists of all real


numbers?

• True(no value of x found for which


propositional function is false)
Example 2

truth value of the quantification ∀x Q(x),


• Let Q(x) be the statement “x < 2.” What is the

where the domain consists of all real


numbers?
False
Counter example

If you found any false example then ∀x Q(x)


Q(3) : 3<2 , false.

is false.
Example 3

∀x P(x) is false where the domain consists


• Suppose that P(x) is “x2 > 0.” show statement

of all integers.
•Solution:
•False
•x = 0 is a counterexample.
Example 4

• What is the truth value of ∀x P(x), where


14

P(x) is the statement “𝑥2 < 10” and the


domain is positive integers not exceeding 4?
Solution:
False
Counter example
• P(4) : 42 < 10, is false,
• Thus ∀x P(x) is false.
EXISTENTIAL QUANTIFIER
• The existential quantification of a predicate P(x) is the
proposition “There exists an x in the universe of discourse
such that P(x) is true.”

• notation ∃x P(x) existential quantifier read as “there exists


an x”

• True
• When 1 true example found
• False
• When No true example found
Example 1

is the truth value of the quantification ∃x


1. Let P(x) denote the statement “x > 3.” What

P(x), where the domain consists of all real


numbers?

True
Example
P(4): 4>3, True
Example 2

1. Let Q(x) denote the statement “x = x

quantification ∃x Q(x), where the domain


+1.”What is the truth value of the

consists of all real numbers?

False(no value of x found for which


propositional function is True)
Example 3

• What is the truth value of ∃x P(x), where P(x)


is the statement “𝑥2 > 10” and the universe of
discourse consists of the positive integers not
exceeding 4?
True
Example
P(4): 42>10, True
Class
Activity
Let Q(x ,y ) denote ‘x+5 >y’
1.Is Q(x ,y ) a proposition?
2.Is Q(3,7) a proposition?
What is the truth value of:
1. Q(3,7)
2. Q(1,6)
3. Q(2,2)
4. Is Q(3,y) a proposition?
Class
Activity
1. What is the truth value of ∀ x (𝑥2 ≥ x)
1. if the domain consists of all real numbers?

2. What is the truth value of ∃z (𝑧2 ≥ 10 )


2. if the domain consists of all integers?

1. if the domain consists of all positive integers not


exceeding 3?
2. if the domain consists of all integers not
exceeding 3?
UNIQUENESS QUANTIFIER
22
• There exists a unique x such that P(x) is true.”
i.e. “there is exactly one” or “there is one and only

• denoted by ∃! or ∃1.
one.”

integers. Then ∃!x P(x) is


• Example: Let P(x) denote x - 1 = 0 and U are the

• true.

integers. Then ∃!x P(x) is


• Example: Let P(x) denote x > 0 and U are the

• false
Quantifiers with Restricted Domains
23

• An abbreviated notation is used to restrict the


domain of a quantifier.
• a condition which variable must satisfy is
included after the quantifier.
Example:
• ∀x < 0 (𝑥2 > 0)
• ∃z > 0 (𝑧2 = 4)
Binding Variables
24

• If there is a quantifier used on a variable x, we

Ex: In ∃ x (x + y = 1 ) , x is bound and y is free


say the variable is bound. Else it is free.

• If all variables in a propositional function are


bound or set equal to a particular value ,

• – Ex: ∀ y ∃ x (x + y = 1 ) is a proposition
the function becomes proposition
Scope of Quantifiers
• proposition ∀ y ∃ x (x + y = 1 ) with two
25

• where ∀ y is applied to ∃ x (x + y = 1 ), and


quantifiers,

∃ x is applied to x + y = 1
•The part of the logical expression where a
quantifier is applied is called the scope of that
quantifier
Example

∃x(x + y = 1)
26

∃x P(x) ∨ Q(x)
•

∃x (P(x) ∨ Q(x))
•

(∃x P(x)) ∨ (∀x


•
•
Q(x))
Precedence of Quantifiers
• The quantifiers ∀ and ∃ have higher
27

precedence than all logical operators from


propositional calculus.
• For example, ∀x P(x) ∨ Q(x) means (∀x
P(x)) ∨

• rather than ∀x(P(x) ∨ Q(x))


Q(x).
Negating Quantified Expressions
28

• ￢∀ x P(x) ≡ ∃x ￢ P(x).
• ￢∃ x Q(x) ≡ ∀x ￢ Q(x).

You might also like