Scribd
Upload
44 views20 pages

Predicates and Quantifiers: Section 1.3

The document discusses predicates, quantifiers, and how to translate English statements to logical expressions using predicates and quantifiers. Specifically: 1) It defines predicates as statements containing variables and become propositions when variables are assigned values or quantified. 2) It introduces universal and existential quantifiers and defines their meanings. Universal quantification means "for all" and existential means "there exists". 3) It provides examples of translating English statements to logical expressions using predicates and quantifiers, emphasizing the appropriate use of implications versus conjunctions with different quantifiers.

Uploaded by

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

Predicates and Quantifiers: Section 1.3

The document discusses predicates, quantifiers, and how to translate English statements to logical expressions using predicates and quantifiers. Specifically: 1) It defines predicates as statements containing variables and become propositions when variables are assigned values or quantified. 2) It introduces universal and existential quantifiers and defines their meanings. Universal quantification means "for all" and existential means "there exists". 3) It provides examples of translating English statements to logical expressions using predicates and quantifiers, emphasizing the appropriate use of implications versus conjunctions with different quantifiers.

Uploaded by

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

Predicates and Quantifiers

Section 1.3

CSE 2813 Discrete Structures


Predicates

• A predicate is a statement that contains


variables.
• Example:
P(x) : x > 3
Q(x,y) : x = y + 3
R(x,y,z) : x + y = z

CSE 2813 Discrete Structures


Predicates

• A predicate becomes a proposition if


the variable(s) contained is(are)
– Assigned specific value(s)
– Quantified
• P(x) : x > 3. What are the truth values of
P(4) and P(2)?
• Q(x,y) : x = y + 3. What are the truth
values of Q(1,2) and Q(3,0)?

CSE 2813 Discrete Structures


Quantifiers

• Two types of quantifiers


– Universal
– Existential
• Universe of discourse - the particular
domain of the variable in a propositional
function

CSE 2813 Discrete Structures


Universal Quantification

• P(x) is true for all values of x in the


universe of discourse.
 x P(x)
– “for all x, P(x)”
– “for every x, P(x)”
– The variable x is bound by the universal
quantifier, producing a proposition

CSE 2813 Discrete Structures


Example

• U = {all real numbers}, P(x): x+1 > x


– What is the truth value of x P(x)
• U = {all real numbers}, Q(x): x < 2
– What is the truth value of x Q(x)
• U = {all students in CSE 2813}
R(x) : x has an account on banner
– What does x R(x) mean?

CSE 2813 Discrete Structures


For universal quantification
P(x)  P(x1)  P(x2)  …  P(xn)

• If the elements in the universe of discourse can be listed,


U = {x1, x2, …, xn}
x P(x)  P(x1)  P(x2)  …  P(xn)

• Example
U = {positive integers not exceeding 3} and P(x): x2 <
10
– What is the truth value of x P(x)
P(1) ^ P(2) ^ P (3)
T ^ T ^ T
T

CSE 2813 Discrete Structures


Existential Quantification

• P(x) is true for some x in the universe of


discourse
 x P(x)
– “for some x, P(x)”
– “There exists an x such that P(x)”
– “There is at least one x such that P(x)”
– The variable x is bound by the existential
quantifier, producing a proposition

CSE 2813 Discrete Structures


Example

• U = {all real numbers}, P(x): x > 3


– What is the truth value of x P(x)
• U = {all real numbers}, Q(x): x = x + 1
– What is the truth value of x Q(x)
• U = {all students in CSE 2813}
R(x) : x has an account on banner
– What does x R(x) mean?

CSE 2813 Discrete Structures


For existential quantification
P(x)  P(x1)  P(x2)  …  P(xn)

• If the elements in the universe of discourse


can be listed, U = {x1, x2, …, xn}
x P(x)  P(x1)  P(x2)  …  P(xn)

• Example
U = {positive integers not exceeding 4} and P(x): x2 >
10
– What is the truth value of x P(x)
P(1) v P(2) v P(3) v P(4)
CSE 2813 Discrete Structures
Binding Variables

• Bound variable: if a variable is quantified


• Free variable: Neither bound nor assigned
a specific value
• Example: x P(x) x Q(x,y)
• Scope of Quantifiers: Part of a logical
expression to which a quantifier is applied
• Example: x (P(x)  Q(x))  x R(x)

CSE 2813 Discrete Structures


Negation of Quantifiers

• Distributing a negation operator across


a quantifier changes a universal to an
existential and vice versa.
~x P(x)  x ~P(x)
~x P(x)  x ~P(x)
• Example:
– P(x) : x has taken a course in calculus

CSE 2813 Discrete Structures


Translating from English
• Many ways to translate a given sentence
• Goal is to produce a logical expression that
is simple and can be easily used in
subsequent reasoning
• Steps:
– Clearly identify the appropriate quantifier(s)
– Introduce variable(s) and predicate(s)
– Translate using quantifiers, predicates, and
logical operators

CSE 2813 Discrete Structures


Example

• Every student in this class has studied


calculus
• Solution 1
– Assume, U = {all students in CSE 2813}
• Solution 2
– Assume, U = {all people}

CSE 2813 Discrete Structures


Example

• Some student in this class has visited


Mexico
• Solution 1
– Assume, U = {all students in CSE 2813}
• Solution 2
– Assume, U = {all people}

CSE 2813 Discrete Structures


More Example

• C(x): x is a CSE student


• E(x): x is an ECE student
• S(x): x is a smart student
• U = {all students in CSE 2813}

CSE 2813 Discrete Structures


More Example (Cont..)

• Everyone is a CSE student.


x C(x)
• Nobody is an ECE student.
x ~E(x) or ~x E(x)
• All CSE students are smart students.
x [C(x)  S(x)]
• Some CSE students are smart students.
x [C(x)  S(x)]

CSE 2813 Discrete Structures


Use implication or
conjunction?
• Universal quantifiers usually take
implications
• All CSE students are smart students.
x [C(x)  S(x)] Correct
x [C(x)  S(x)] Incorrect

CSE 2813 Discrete Structures


Use implication or
conjunction?
• Existential quantifiers usually take
conjunctions
• Some CSE students are smart students.
x [C(x)  S(x)] Correct
x [C(x)  S(x)] Incorrect

CSE 2813 Discrete Structures


More Example
• No CSE student is an ECE student.
– If x is a CSE student, then that student is
not an ECE student.
x [C(x)  ~E(x)]
– There does not exist a CSE student who is
also an ECE student.
~x [C(x)  E(x)]
• If any ECE student is a smart student
then he is also a CSE student.
x [(E(x)  S(x))  C(x)]
CSE 2813 Discrete Structures

You might also like