Scribd
Upload
8 views

Predicate S

Uploaded by

Saad Malik
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 views

Predicate S

Uploaded by

Saad Malik
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/ 13

Predicates and Quantifiers

there are some statements which cannot be called true or false like:

“x > 3,” “x = y + 3,” “x + y = z,” In these examples x is the subject and “>3” is
predicate
and

“computer x is under attack by an intruder,”


In these examples Computer x is the subject and
and the remaining sentence is predicate

“computer x is functioning properly,”

Because values are not assigned to the variable x.


We need to convert predicate into proposition to define a
truth value but how?
we denote the statement with P(variable) like P(x) : x > 3, then we assign a value to x to
find out the truth value of the statement. See the below examples
Example: Let P(x) denote the statement “x > 3.” What are the truth values of P(4) and P(2)?

Solution: We obtain the statement P(4) by setting x = 4 in the statement “x > 3.” Hence, P(4), which is the
statement “4 > 3,” is true. However, P(2), which is the statement “2 > 3,” is false.

Example: Let A(x) denote the statement “Computer x is under attack by an intruder.” Suppose that of the
computers on campus, only CS2 and MATH1 are currently under attack by intruders. What are truth values of
A(CS1), A(CS2), and A(MATH1)?

A(CS1) is false A(CS2) is true A(MATH1) is true


Example: 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)?

Solution in class
Example: Let A(c, n) denote the statement “Computer c is connected to network n,” where c is a variable
representing a computer and n is a variable representing a network. Suppose that the computer MATH1 is
connected to network CAMPUS2, but not to network CAMPUS1.

What are the values of A(MATH1, CAMPUS1) and A(MATH1, CAMPUS2)?

Solution in class
Quantifiers
Quantification expresses the extent to which a predicate is true over a
range of elements.
When the variables in a propositional function are assigned values, the
resulting statement becomes a proposition with a certain truth value.
However, there is another important way, called quantification,
THE UNIVERSAL QUANTIFIER
THE EXISTENTIAL QUANTIFIER
Solution in class
Solution in class

Solution in class
Solution in class
Negating Quantified Expressions
let x represents a student and domain of x is every student in the class. Let P(x) is statement “x has read ITC” and ¬P(x) means “x
has not read ITC”

Quantifier Meaning When true? When false? Negation Meaning When True? When false? Equivalence

∀xP(x) all students When every When at- ¬∀xP(x) all students when ∀xP(x) when ∀xP(x) ¬∀xP(x) ≡
in the class x has read least 1 have not is false is true ∃x¬P(x)
has read ITC student has read ITC means no
ITC not read ITC one student
has not read
ITC

∃xP(x) There is at- When at- When all ¬∃xP(x) There is no when ∃xP(x) when ∃xP(x) ¬∃xP(x) ≡
least one least one students not one student is false, is true, ∀x¬P(x)
student who student has read ITC who has means all means at-
has read read ITC read ITC the students least one
ITC have not student has
read ITC read ITC

You might also like