DBM20083 Mathematic Discrete - Notes LW1
DBM20083 Mathematic Discrete - Notes LW1
MATHEMATICS
~Lecture Week 1~
CHAPTER 1: BASIC LOGIC AND PROOFS
1.1 Derive Propositional Logic
1.1.1 Define the purpose of proposition logic
1.1.2 Carry out the formulae in proposition logic
(a) Negation
(b) Conjuction
(c) Disjunction
(d) Conditional
(e) Biconditional
(f) Tautology
1.1.3 Identify the compound proposition
1.1.4 Construct the truth table
1.1.1 DEFINE THE PURPOSE OF PROPOSITION LOGIC
Conditional Biconditional
𝑝→𝑞 𝑝↔𝑞
CONJUNCTION
𝑝 ∧ 𝑞 (READ AS 𝑝 AND 𝑞)
Example: The truth value of 𝑝 ∧ 𝑞
𝑝: 5 + 3 = 8 𝑝 𝑞 𝑝∧𝑞
𝑞:A decade is 10 years.
T T T
T F F
𝑝∧𝑞
5 + 3 = 8 and a decade is 10 F T F
years. F F F
Another answer
𝑝∧𝑞
5 + 3 = 8 but a decade is 10
years.
Example:
Determine the following statement is true (T) or false (F):
Kota Kinabalu is in Sabah and 2+2=4
Answer:
𝑇∧𝑇 =𝑇
Exercise 1B
Determine whether the statements are true (T) or false (F).
(1)3+2=5 and 4+4=8
(2)Changlun is in Perlis and Alor Setar is in Kedah.
(3)−48 < −47 and 25+3=38
(4)Duck has 4 legs and cat has wings.
5 3 47
(5)4x + 3x = 5x and + =
4 7 28
DISJUNCTION
𝑝 ∨ 𝑞 (READ AS 𝑝 OR 𝑞)
Exercise 1C
Determine whether the statements are true (T) or false (F).
(1)3+2=5 or 4+4=8
(2)Changlun is in Perlis or Alor Setar is in Kedah.
(3)−48 < −47 or 25+3=38
(4)Duck has 4 legs or cat has wings.
5 3 47
(5)4x + 3x = 5x or + =
4 7 28
Example:
NEGATION
¬𝑝 (READ AS NOT 𝑝)
Write the negation for each of the following
proposition.
(a) 5 + 3 = 8 The truth value of ¬𝑝
(b) A decade is 10 years. 𝑝 ¬𝑝
QUESTION 1
Identify each of the following sentence whether a proposition or not and state the
truth value.
(a) Is 2 a positive number? (1 mark)
(b) A triangle is a three-sided polygon (2 marks)
(c) 4+9 > 9 (2 marks)
QUESTION 2
Let p denote “ John is rich” and q denote “ John is happy”. Write each statement in
symbolic form using p and q.
(a) If John is rich, then he is unhappy.
(b) John is neither rich nor happy.
(c) It is necessary to be poor in order to be happy.
(d)John is unhappy if and only is he is poor.
(e)To be poor is to be unhappy.
(10 marks)
1.1.4 METHOD FOR CONSTRUCTING TRUTH TABLES
A logical statement/proposition having n component
statements will have 2𝑛 rows in its truth table.
Example:
If we have two propositions (p and q), therefore, we will have
22 =4 rows.
If we have three propositions (p, q and r), therefore we will Three propositions
have 23 =8 rows.
Look at the picture below: 𝑝 𝑞 𝒓
T T T
Two propositions
T T F
𝑝 𝑞 T F T
T T T F F
T F F T T
F T F T F
F F F F T
F F F
Example:
Construct the truth table for 𝑝 ∧ ¬𝑝𝑉¬𝑞
Solution:
First, we know that there are 2 propositions involved. Therefore, there will be 4 rows in
the
truth table.
Next, there are brackets and 2 negations (2 additional columns) connected with the
symbol 𝑉 (1 additional column) and the last column is what we need to construct.
𝑝 𝑞 ¬𝑝 ¬𝑞 ¬𝑝𝑉¬𝑞 𝑝 ∧ ¬𝑝𝑉¬𝑞
T T F F F F
T F F T T T
F T T F T F
F F T T T F
Example:
If 𝑝 represents the statement 4 > 1, 𝑞 represent the statement 12 < 9, and 𝑟 represent 0 <
1,decide whether the following statement is TRUE or FALSE.
¬𝑝 ∧ 𝑟 𝑉 ¬𝑞 ∧ 𝑝
Solution:
𝑝 𝑞 𝑟 ¬𝑝 ¬𝑞 ¬𝑝 ∧ 𝑟 ¬𝑞 ∧ 𝑝 ¬𝑝 ∧ 𝑟 𝑉ሺ¬𝑞
∧ 𝑝ሻ
The truth
T T T F F F F F value
T T F F F F F F for the
T F T F T F T T statement is
TRUE.
T F F F T F T T
F T T T F T F T
F T F T F F F F
F F T T T T F T
F F F T T F F F
Exercise 1H
Construct the truth table for each of the following:
(a) ¬𝑝 ∧ 𝑞
(b) ¬𝑝 𝑉 𝑞 → ¬𝑞
(c) 𝑝 ∧ ¬𝑞 𝑉 𝑟
(d) ¬𝑝 ↔ 𝑞 𝑉 𝑟
LOGICAL EQUIVALENCE
Two statement forms are called logically equivalent (≡ ) if and only if they have
same truth value in every possible situation.
Example: Example:
Are the following statements Determine whether the statement forms
equivalent? ¬ 𝑝 ∧ 𝑞 and ¬𝑝 ∧ ¬q are logically equivalent or
𝑝 ∧ 𝑞 and 𝑞 ∧ p not.
Solution: Solution:
𝑝 𝑞 𝑝∧𝑞 𝑞∧p 𝑝 𝑞 𝑝∧𝑞 ¬ 𝑝∧𝑞 ¬𝑝 ¬q ¬𝑝 ∧ ¬q
T T T T T T T F F F F
T F F F T F F T F T F
F T F F F T F T T F F
F F F T T T T
F F F F
𝑝∧𝑞 ≡𝑞∧p ¬ 𝑝 ∧ 𝑞 ≢ ¬𝑝 ∧ ¬q
LOGICAL EQUIVALENCES
Given any statement variables 𝑝, 𝑞 𝑎𝑛𝑑 𝑟, a tautology 𝒕 and a contradiction 𝒄, the
following logical equivalences hold :
1. Commutative laws : 𝑝Λ𝑞 ≡𝑞Λ𝑝 𝑝V𝑞 ≡𝑞V𝑝
2. Associative laws : 𝑝Λ𝑞 Λ𝑟 ≡𝑝Λ 𝑞Λ𝑟 𝑝V𝑞 V𝑟 ≡𝑝V 𝑞V𝑟
3. Distributive laws : 𝑝Λ 𝑞V𝑟 ≡ 𝑝Λ𝑞 V 𝑝Λ𝑟 𝑝V 𝑞Λ𝑟 ≡ 𝑝V𝑞 Λ 𝑝V𝑟
4. Identity laws : 𝑝Λ𝒕 ≡𝑝 𝑝V𝒄 ≡𝑝
5. Negation laws : 𝑝V¬𝑝 ≡𝒕 𝑝Λ¬𝑝 ≡𝒄
6. Double negative law : ¬ ¬𝑝 ≡𝑝
7. Idempotent laws : 𝑝Λ𝑝 ≡𝑝 𝑝V𝑝 ≡𝑝
8. Universal bound laws : 𝑝V𝒕 ≡𝒕 𝑝Λ𝒄 ≡𝒄
9. De Morgan’s laws : ¬ 𝑝Λ𝑞 ≡¬𝑝V¬𝑞 ¬ 𝑝V𝑞 ≡¬𝑝Λ¬𝑞
10. Absorption laws : 𝑝V 𝑝Λ𝑞 ≡𝑝 𝑝Λ 𝑝V𝑞 ≡𝑝
11. Negations of 𝒕 and 𝒄 : ¬𝒕 ≡𝒄 ¬𝒄 ≡𝒕
Exercise 1I
1. Show that the statements below are logically equivalent or not.
a) i: ¬ 𝒑 𝚲 𝒒
ii: ¬ 𝒑 𝑽 ¬ 𝒒
b) i: ¬ 𝒑 ↔ 𝒒
ii: ¬ 𝒒 ↔ 𝒑
QUESTION 1
Show that 𝑝 → 𝑞 and ~𝑝 → ~𝑞 are NOT logically equivalent to each other.
(5 marks)
TAUTOLOGY, CONTRADICTION & CONTIGENCY
TAUTOLOGY CONTRADICTION
A proposition 𝑃 𝑝, 𝑞, 𝑟, … … is a A proposition 𝑃 𝑝, 𝑞, 𝑟, … … is a contradiction if it
tautology if it contains only T in the contains only F in the last column of its truth table.
last column of its truth table. In other words they are false for any truth values of
In other words they are true for any their variables.
truth values of their variables.
Example: Example:
𝑝 ¬𝑝 𝑝 ∧ ¬𝑝
𝑝 ¬𝑝 𝑝 𝑽¬𝑝 T F F
T F T F T F
F T T
Example:
𝑝 𝑞 𝒑𝐕𝒒
T T T
T F T
F T T
F F F
2. Use a truth table to show that the proposition 𝒑⋁ 𝒒⋁ ∼ 𝒑 is always true (T).