Scribd
Upload
4 views38 pages

Chapter 1 Math

about math

Uploaded by

KaSha a.k.a Shafiq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views38 pages

Chapter 1 Math

about math

Uploaded by

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

CHAP 1: QUANTIFIERS

DISCRETE MATHEMATICS II
MAT202/ MAT2043

By Dr. Fatimah Bibi Hamzah

CLO: Apply propositional logic, quantifiers and rules of inference in proving validity of
arguments.
NUMBER THEORY
PREDICATES
Predicate: It is the verbal statement which describes
the property of a variable. Usually represented by the
capital letter P, Q, R,… the notation P(x) is used to
represent some unspecified property or predicate that
x may have.
To write in predicate logic:
“ x is greater than 3”

subject predicate
PREDICATES
We introduce a (functional) symbol for the predicate,
and put the subject as an argument (to the functional
symbol):

Example 1
Father(x): unary predicate
Brother(x,y): binary predicate
Sum(x,y,z): ternary predicate
P(x,y,z,t): n-ary predicate
EXAMPLE 2
LET’S TRY IT OUT!
2 2 2
Let Q(x, y, z) denote the statement “x + y = z ”.
LET’S TRY IT OUT!

What is the truth value of Q(3, 4, 5)?


What is the truth value of Q(2, 2, 3)?
QUANTIFIERS
LET’S TRY THIS!
LET’S TRY THIS!
Translation of Verbal Statements to
Symbolic
Form Using Intermediate Statements
Let P(x) be the predicate “x must take a discrete mathematics course”
and let Q(x) be the predicate “x is a computer science student”.

The universe of discourse for both P(x) and Q(x) is all KUPTM
LET’S TRY IT OUT!

students.

Express the statement “Every computer science student must take a


discrete mathematics course”.

ANSWER: ∀x(Q(x) → P(x))

Express the statement “Everybody must take a discrete mathematics


course or be a computer science student”.

ANSWER: ∀x(Q(x) ∨ P(x))


Suppose R(x, y) is the predicate “x understands
y,” and the universe of discourse for x is the set
EXAMPLE

of students in your discrete class, and the


universe of discourse for y is the set of examples
in these lecture notes. Pay attention to the
differences in the following propositions.
1. ∃x∀yR(x, y) is the proposition “There exists a student in this class
who understands every example in these lecture notes.”

2. ∀y∃xR(x, y) is the proposition “For every example in these lecture


EXAMPLE

notes there is a student in the class who understands that example.”

3. ∀x∃yR(x, y) is the proposition “Every student in this class


understands at least one example in these notes.”

4. ∃y∀xR(x, y) is the proposition “There is an example in these notes


that every student in this class understands.”
Arguments using quantified statements
Negate the proposition “Every student in this class
understands at least one example in these notes.”
EXAMPLE

Apply De Morgan’s Laws to negate the symbolic


form of the proposition:

¬(∀x∃yR(x, y))
⇔ ∃x(¬∃yR(x, y))
⇔ ∃x∀y¬R(x, y)
EXAMPLE
Show that the argument given is valid.

Every student passing Discrete Structures worked hard.


EXAMPLE

Peter passed Discrete Structures.


Hence, there is one student that worked hard.
Show that the argument given is valid.

All students passing DS are smart.


EXAMPLE

Some students passing DS are from Kuala Lumpur.


Therefore, some smart students are from Kuala Lumpur

You might also like