DISCRETE

MATHEMATICS
AND
ITS APPLICATIONS
Book: Discrete Mathematics and Its Applications
Author: Kenneth H. Rosen
Sixth Edition
McGraw-Hill International Edition
 Chapter 1
The Foundations:
Logic and Proofs
 Objectives
 Explain what makes up a correct mathematical
argument
 Introduce tools to construct arguments
 Contents
1.1-Propositional Logic – Logic mệnh đề
1.2-Propositonal Equivalences
1.3-Predicates and Quantifiers (vị ngữ và lượng từ)
1.4-Nested Quantifiers
1.5-Rules of Inference – Các quy tắc suy diễn
 1.1- Propositional Logic

1.1.1- Definitions and Truth Table

1.1.2- Precedence of Logical Operators
 1.1.1- Definitions and Truth Table

 Proposition is a declarative sentence that is either

true or false but not both.
 Proposition is a sentence that declares a fact.
 Examples:
* I am a girl
* Ha Noi is not the capital of Vietnam OK
* 1+5 < 4
* What time is it?
No OK
* X+Y=Z
 1.1.1- Definitions…

 Truth table
– I am a girl

p
True/ T / 1
False / F / 0
 1.1.1- Definitions…
 Negation of propositions p is the statement “ It is
not case that p”.
 Notation: p (or p)
 1.1.1- Definitions…
 Conjunction( hội) of propositions p and q is the
proposition “ p and q” and denoted by p^q

p q p^q
0 0 0
0 1 0
1 0 0
1 1 1
 1.1.1- Definitions…
 Disjunction (tuyển) of propositions p and q is the
proposition “ p or q” and denoted by p v q

p q pq
0 0 0
0 1 1
1 0 1
1 1 1
 1.1.1- Definitions…
 Exclusive-or (xor) (tuyển loại) of propositions p and
q, denoted by p  q

p q pq
0 0 0
0 1 1
1 0 1
q 1 1 0
 1.1.1- Definitions…
 Implication: p → q (p implies q)
 p: hypothesis / antecedent / premise p q p→q
 q: conclusion / consequence 0 0 1
 p → q can be expressed as: 0 1 1
- q if p
1 0 0
- If p, then q
-
1 1 1
p is sufficient condition for q
- q is necessary condition for p
- -
“If 1 + 1 = 3, then dogs can
fly”  TRUE
(p  q)
p=0, q=0 ,
so (pq) is true.
 1.1.1- Definitions…
 Biconditional statement p  q is the proposition “ p if and only
if q”
 p → q (p only if q) and pq (p if q)

p q p→q q→p p↔q

0 0 1 1 1
0 1 1 0 0
1 0 0 1 0
1 1 1 1 1
1.1.2- Precedence of Logical Operators

0
 1.2- Propositional Equivalences

1.2.1- Tautology (hằng đúng) and Contradiction

1.2.2- Logical Equivalences
1.2.3- De Morgan’s Laws
 1.2.1- Tautology and Contradiction
 Tautology is a proposition that is always true
 Contradiction is a proposition that is always false
 When p ↔ q is tautology, we say “p and q are called logically
equivalence”. Notation: p ≡ q
 Example 3 p.23

 Show that p  q and ¬p v q are logically

equivalent.
 1.2.2- Logical Equivalences…
Equivalence Name
p^T≡p pvF≡p Identity laws- Luật đồng nhất
pvT≡ T p^F ≡ F Domination Laws – Luật chi phối
pvp≡ p p^p ≡ p Idempotent Laws – Luật bất biến
¬(¬p) ≡ p Double Negation Laws – Luật đảo kép
pvq≡qvp p^q ≡q^p Commutative Laws – Luật giao hoán
(p v q) v r ≡ p v (q v r) Associative Laws – Luật kết hợp
(p ^ q) ^ r ≡p^(q^r)
pv (q^r) ≡ (pvq) ^ (pvr) Distributive Laws – Luật phân phối
p^ (qvr) ≡ (p^q) v (p^r)
¬ (p^q) ≡ ¬pv¬q ¬(pvq) ≡ ¬p^¬q De Morgan Laws
pv (p^q)≡ p p^(pvq)≡ p Absorption Laws – Luật hấp thụ
pv¬p ≡ T p^¬p≡ F Negation Laws - Luật nghịch đảo
 1.2.2- Logical Equivalences…
Equivalences Equivalences
p→q ≡ ¬pvq p↔q ≡ (p→q) ^ (q→p)
p→q ≡ ¬q → ¬p p↔q ≡ ¬p ↔ ¬q
pvq ≡ ¬ p → q p↔q ≡ (p ^ q) v (¬p ^ ¬q)
p^q ≡ ¬ (p → ¬q) ¬ (p↔q) ≡ p↔ ¬q
¬(p→q) ≡ p^¬q
(p→q) ^(p→r) ≡ p → (q^r)
(p→r) ^ (q→r) ≡ (pvq) → r
(p→q) v (p→r) ≡ p→ (qvr)
(p→r) v (q→r) ≡ (p^q) → r

Important:
Question:
 1.3- Predicates and Quantifiers

 Introduction
 Predicates
 Quantifiers
 1.3.1- Introduction

 A type of logic used to express the meaning of a wide

range of statements in mathematics and computer
science in ways that permit us to reason and
explore relationships between objects.
1.3.2- Predicates – vị ngữ
 1.3.3- Quantifiers – Lượng từ
 The words in natural language: all, some, many, none,
few, ….are used in quantifications.

 Uniqueness quantifier: !x P(x) or 1xP(x)

 1.3.4- Quantifiers and Restricted
Domains
x<0(x2 > 0), y  0(y3  0), z>0(z2 =2)

x(X<0 ^x2 > 0), y(y  0 ^y3  0), z(z>0 ^ z2 =2)

Restricted domains
 1.3.5- Precedence of Quantifiers

 Quantifier have higher precedence than all logical

operators from propositional calculus.
 xP(x) v Q(x)  (xP(x)) v Q(x)
  has higher precedence. So,  affects on P(x) only.
1.3.6 - Logical Equivalences Involving Quantifiers

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 the statements and which domain of discourse is
used for the variables in these propositional functions.
 x (P(x) ^ Q(x)) ≡ xP(x) ^ xQ(x)

Expression Equivalence Expression Negation

¬xP(x) x ¬P(x) xP(x) x ¬P(x)

¬ xP(x) x ¬P(x) xP(x) x ¬P(x)

 1.3.7- Translating

 For every student in the class has studied calculus

 For every student in the class, that student has studied calculus
 For every student x in the class, x has studied calculus
 x (S(x) → C(x))
 See page: 48
 Negating nested quantifiers

¬ xy(xy=1) ≡ x ¬y (xy=1) // De Morgan laws

≡ (x) (y) ¬(xy=1)
≡ (x) (y) (xy  1)
Nested Quantifiers
Nested Quantifiers
 1.5- Rules of Inference – Quy tắc
diễn dịch

 Definitions
 Rules of Inferences
 1.5.1- Definitions

 Proposition 1 // Hypothesis – giả thiết

 Proposition 2
 Proposition 3 Arguments 2,3,4 are
premises (tiên đề) of
 Proposition 4
argument 5
 Proposition 5
 ……… Argument s– suy luận
Propositional
 Conclusion Equivalences
 1.5.2- Rules Inferences
If Socrates is human, then Socrates is mortal.
Socrates is human.
Rule Tautology  Socrates is mortal. Name
p [p^ (p→q)] → q Modus ponen
p →q You work hard Quy tắc khẳng
q If you work hard then you will pass the examination định
you will pass the examination
¬q [¬q ^(p → q)] → ¬p Modus tollen
p→q She did not get a prize
¬p If she is good at learning she will get a prize Quy tắc phủ
She is not good at learning định
p →q [(p →q) ^(q →r)] →(p→r) Hypothetical
q →r If the prime interest rate goes up then the stock prices go syllolism – Tam
p →r down. đoạn luận giả
If the stock prices go down then most people are thiết,
unhappy. Quy tắc bắc cầu
If the prime interest rate goes up then most people are
unhappy. Một ngôi nhà rẻ thì hiếm
Cái gì hiếm thì đắt
 Một ngôi nhà rẻ thì đắt.
 Rules Inferences…
Rule Tautology Name
pvq [(pvq) ^¬p] → q Disjunctive syllogism
¬p Power puts off or the lamp is malfunctional
q Power doesn’t put off
the lamp is malfunctional
p p →(pvq) Addition
pvq It is below freezing now
It is below freezing now or raining now
p^q (p^q) →p Simplication
p It is below freezing now and raining now
It is below freezing now
p [(p) ^(q)) → (p^q) Conjunction
q
p^q
pvq [(pvq) ^(¬pvr)] →(qvr) Resolution
¬pvr Jasmin is skiing OR it is not snowing
qvr It is snowing OR Bart is playing hockey
Jasmin is skiing OR Bart is playing hockey
 1.5.3- Fallacies – ngụy biện – sai logic
 If you do every problem in this book then you will learn discrete
mathematic
You learned mathematic
(p → q) ^q
=(¬ p v q) ^ q
(absorption law) (luật hút)
=q
 No information for p
p can be true or false  You may learn discrete mathematic but you
might do some problems only.
 Fallacies…
 (p → q)^q  p is not a tautology
( it is false when p = 0, q = 1)
 (p  q)^¬p  ¬q is not a tautology
(it is false when p = 0, q = 1)

Hắn chửi như những người say rượu hát. Giá hắn biết hát
thì hắn có lẽ hắn không cần chửi. Khổ cho hắn và khổ cho
người, hắn lại không biết hát. Thì hắn chửi, cũng như
chiều nay hắn chửi….. (Nam Cao, Chí Phèo, trang 78)
p→¬q
¬p
 ¬(¬q) = q là không hợp logic
 1.5.4- Rules of Inference for
Quantified Statements
Rule Name
xP(x) Universal Instantiation
P(c) Cụ thể hóa lượng từ phổ dụng
P(c) for arbitrary c Universal generalization
xP(x) Tổng quát hóa bằng lượng từ phổ dụng
xP(x) Existential instantiation
P(c) for some element c Chuyên biệt hóa
P(c) for some element c Existential generalization
xP(x) Khái quát hóa bằng lượng từ tồn tại
Rules of Inference for Quantified Statements…

 “All student are in this class had taken the

course PFC”
 “HB is in this class”
 “Had HB taken PFC?”
 x(P(x) → Q(x)) Premise

 P(HB) → Q(HB) Universal Instantiation

 P(HB) Modus ponens

 Q(HB) // conclusion
 Summary
 Propositional Logic – Luận lý mệnh đề
 Propositional Equivalences
 Predicates and Quantifiers
 Nested Quantifiers
 Rules and Inference – Quy tắc và diễn
dịch
THANK YOU