Professional Documents
Culture Documents
Untitled
Untitled
Problem Exercises #3
Due: December 12, 2022 (Monday) 12NN
Instruction: Form a group of five (5) and answer the following completely and neatly on a white short
bond paper (subs 24 GSM 80), no need to put in a folder. Submit on or before the due date stated
above. NO submission will be accepted beyond the deadline.
𝑝 𝑞 𝑟 ~𝑝 ~𝑝 ∧ 𝑞 (~ 𝑝 ∧ 𝑞) ∨ 𝑟 (~ 𝑝 ∧ 𝑞 ) ∧ [ (~𝑝 ∧ 𝑞 ) ∨ 𝑟 ]
T T T F F T F
T T F F F F F
T F T F F T F
T F F F F F F
F T T T T T T
F T F T T T T
F F T T F T F
F F F T F F F
2. [( 𝑝 → 𝑞 ) ∨ (𝑟 ∧ ~𝑝)] → (𝑟 ∨ ~𝑞)
T T T F F T F T T T
T T F F F T F T F F
T F T F T F F F T T
T F F F T F F F T T
F T T T F T T T T T
F T F T F T F T F F
F F T T T T T T T T
F F F T T T F T T T
B. Determine whether each statement is true or false. Justify your answer. No justification, no point.
1. (−1)47 = −1 or (−1)−102 = 1.
TRUE. This is a disjunction. If at least one of the simple statements is true, the
disjunction is true. Both simple statements are actually true.
2. 3356 is odd and 7143 is even.
FALSE. This is a conjunction. Because the simple statement 7143 is even is false, the
conjunction is false. The ones digit of 7143 is 3 which is odd.
3. If 𝑛 is a prime number, then 𝑛3 is a prime number.
FALSE. The 𝑛3 of a prime number is no longer prime. Verify by contrapositive.
4. The lower the standard deviation is better or the higher the relative score is better.
TRUE. This is a disjunction. Both are true.
5. If 𝑥 < 1 then one over 𝑥 is greater than one.
FALSE. Let 𝑥 = −2 or any negative number, or maybe 0. Verify by contrapositive.
6. 𝑥 − 5 ≥ 7 if and only if 𝑥 ≥ 15.
FALSE. Let x = 13.
Because both have the same truth values, they are equivalent.
2. 𝑝 ∨ (~𝑟 ∧ 𝑝), ~𝑝
𝑝 ~𝑟 ~𝑟 ∧ 𝑝 𝑝 ∨ (~𝑟 ∧ 𝑝) ~𝑝
T F F T F
T T T T F
F F F F T
F T F F T
Not equivalent.
3. ~𝑞 → 𝑝, 𝑝∨𝑞
𝑝 𝑞 ~𝑞 ~𝑞 → 𝑝 𝑝∨𝑞
T T F T T
T F T T T
F T F T T
F F T F F
Equivalent.
4. ~𝑝 → ( 𝑝 ∨ 𝑟), 𝑟
𝑝 ~𝑝 𝑟 𝑝∨𝑟 ~𝑝 → ( 𝑝 ∨ 𝑟) 𝑟
T F T T T T
T F F T T F
F T T T T T
F T F F F F
Not equivalent.
D. Use conjunction and disjunction to determine an equivalent form of the following statements.
1. [~(𝑝 → ~𝑟) ∧ ~𝑞] → 𝑟
↔ [(𝑝 ∧ 𝑟) ∧ ~𝑞] → 𝑟 , ~(𝑝 → 𝑞) ≡ 𝑝 ∧ ~𝑞
↔ ~ [(𝑝 ∧ 𝑟) ∧ ~𝑞] ∨ 𝑟 , 𝑝 → 𝑞 ≡ ~𝑝 ∨ 𝑞
This is okay already.
OR
↔ [~(𝑝 ∧ 𝑟) ∨ 𝑞 ] ∨ 𝑟 , De Morgan’s Law
2. [ 𝑝 ∧ (𝑟 → ~𝑞 )] → (𝑟 ∨ 𝑞)
↔ [ 𝑝 ∧ (~𝑟 ∨ 𝑞 )] → (𝑟 ∨ 𝑞) , 𝑝 → 𝑞 ≡ ~𝑝 ∨ 𝑞
↔ ~[ 𝑝 ∧ (~𝑟 ∨ 𝑞 )] ∨ (𝑟 ∨ 𝑞) , 𝑝 → 𝑞 ≡ ~𝑝 ∨ 𝑞
This is okay already. You can further determine other equivalent forms by
applying basic law.
~𝑝 𝑞 𝑟
𝑝 𝑞 ~𝑟
𝑝 𝑞 𝑟