John Alexis A.

Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

Chapter I: LOGIC | Assessment (January 2, 2021)

I. True or False
1. ~q, FALSE
2. ~p, FALSE
3. p ↔ q, TRUE
4. ~p ^ ~q, FALSE
5. r v p, TRUE
6. (~r) → q, TRUE
7. r → (~p), TRUE
8. q ^ (~r), TRUE
9. r → (p v q), TRUE
10. (q ^ r) → p, TRUE
II. Truth Tables
1. (a → b) ↔ (a ∧ ∼ b)

a b ~b a→b a∧ ∼ b (a → b) ↔ (a∧ ∼ b)
T T F T F F
F T F T F F
T F T F T F
F F T T F F
The compound proposition (a → b) ↔ (a∧ ∼ b) is a Contradiction.

2. (r → (s ∨ t)) ↔ ((p → q) ∨ ∼ r)
Let: X = (s v t); Y = (p → q); and Z = (r → X) ↔ (Y ∨ ∼ r)

r s t p q ~r X Y r→X Y v ~r Z
T T T T T F T T T T T
F T T T T T T T T T T
T F T T T F T T T T T
F F T T T T T T T T T

1|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

T T F T T F T T T T T
F T F T T T T T T T T
T F F T T F F T F T F
F F F T T T F T T T T
T T T F T F T T T T T
F T T F T T T T T T T
T F T F T F T T T T T
F F T F T T T T T T T
T T F F T F T T T T T
F T F F T T T T T T T
T F F F T F F T F T F
F F F F T T F T T T T
T T T T F F T F T F F
F T T T F T T F T T T
T F T T F F T F T F F
F F T T F T T F T T T
T T F T F F T F T F F
F T F T F T T F T T T
T F F T F F F F F F T
F F F T F T F F T T T
T T T F F F T T T T T
F T T F F T T T T T T
T F T F F F T T T T T
F F T F F T T T T T T
T T F F F F T T T T T
F T F F F T T T T T T
T F F F F F F T F T F
F F F F F T F T T T T

The compound proposition (r → (s ∨ t)) ↔ ((p → q) ∨ ∼ r) is a Contingency.

2|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

3. ((x → y) ∧ (y → z)) → (x → z)
Let: A = (x → y); B = (y → z); and C = (x → z)

x y z A B C A∧B ( A ∧ B) → C
T T T T T T T T
F T T T T T T T
T F T F T T F T
F F T T T T T T
T T F T F F F T
F T F T F T F T
T F F F T F F T
F F F T T T T T

The compound proposition ((x → y) ∧ (y → z)) → (x → z) is a Tautology.

III. Test of Validity
1. ((p → q) ∧ (r → s) ∧ (p ∨ r)) ⇒ (q ∨ s) 2. ((i → j) ∧ (j → k) ∧ (l → m) ∧ (i ∨ l)) ⇒ (∼ k∧ ∼ m) 3. [((n ∨ m) → p) ∧ ((p ∨ q) → r) ∧ (q ∨ n) ∧ (∼ q)] ⇒ r

p→q i→j (n ∨ m) → p
T T F T T T (T T F) T
r→s j→k T
F T F T T T (p ∨ q) → r
p∨ r l→m (T T F) F
T T F F T F T
∴q∨s i∨l q∨n
F F F T T F F T T
∴∼ k∧∼ m ∼q
[(F ^ T ^ T) → F] F F T T
The argument is valid. [(T ^ T ^ T ^ T) → F] ∴r
The argument is invalid. F
[(T ^ F ^ T ^ T) → F]
The argument is valid.

3|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

Truth Tables

1. ((p → q) ∧ (r → s) ∧ (p ∨ r)) ⇒ (q ∨ s)

Let A = ((p → q) ∧ (r → s) ∧ (p ∨ r))

p q r s (p → q) (r → s) (p ∨ r) A (q ∨ s) A ⇒ (q ∨ s)
T T T T T T T T T T
F T T T T T T T T T
T F T T F T T F T T
F F T T T T T T T T
T T F T T T T T T T
F T F T T T F F T T
T F F T F T T F T T
F F F T T T F F T T
T T T F T F T F T T
F T T F T F T F T T
T F T F F F T F F T
F F T F T F T F F T
T T F F T T T T T T
F T F F T T F F T T
T F F F F T T F F T
F F F F T T F F F T

2. ((i → j) ∧ (j → k) ∧ (l → m) ∧ (i ∨ l)) ⇒ (∼ k∧ ∼ m)

Let X = ((i → j) ∧ (j → k) ∧ (l → m) ∧ (i ∨ l)); Y = (∼ k∧ ∼ m)

i j k l m ~k ~m i→j j→k l→m i∨l X Y X⇒Y

T T T T T F F T T T T T F F
F T T T T F F T T T T T F F
T F T T T F F F T T T F F T
F F T T T F F T T T T T F F

4|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

T T F T T T F T F T T F F T
F T F T T T F T F T T F F T
T F F T T T F F T T T F F T
F F F T T T F T T T T T F F
T T T F T F F T T T T T F F
F T T F T F F T T T F F F T
T F T F T F F F T T T F F T
F F T F T F F T T T F F F T
T T F F T T F T F T T F F T
F T F F T T F T F T F F F T
T F F F T T F F T T T F F T
F F F F T T F T T T F F F T
T T T T F F T T T F T F F T
F T T T F F T T T F T F F T
T F T T F F T F T F T F F T
F F T T F F T T T F T F F T
T T F T F T T T F F T F T T
F T F T F T T T F F T F T T
T F F T F T T F T F T F T T
F F F T F T T T T F T F T T
T T T F F F T T T T T T F F
F T T F F F T T T T F F F T
T F T F F F T F T T T F F T
F F T F F F T T T T F F F T
T T F F F T T T F T T F T T
F T F F F T T T F T F F T T
T F F F F T T F T T T F T T
F F F F F T T T T T F F T T

3. [((n ∨ m) → p) ∧ ((p ∨ q) → r) ∧ (q ∨ n) ∧ (∼ q)] ⇒ r

Let: D = (n ∨ m); E = (p ∨ q); F = (q ∨ n); and G = [(D → p) ∧ (E → r) ∧ F ∧ (∼ q)]

5|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

n m q p r ~q D D→p E E→r F G G⇒r

T T T T T F T T T T T F T
F T T T T F T T T T T F T
T F T T T F T T T T T F T
F F T T T F F T T T T F T
T T F T T T T T T T T T T
F T F T T T T T T T F F T
T F F T T T T T T T T T T
F F F T T T F T T T F F T
T T T F T F T F T T T F T
F T T F T F T F T T T F T
T F T F T F T F T T T F T
F F T F T F F T T T T F T
T T F F T T T F F T T F T
F T F F T T T F F T F F T
T F F F T T T F F T T F T
F F F F T T F T F T F F T
T T T T F F T T T F T F T
F T T T F F T T T F T F T
T F T T F F T T T F T F T
F F T T F F F T T F T F T
T T F T F T T T T F T F T
F T F T F T T T T F F F T
T F F T F T T T T F T F T
F F F T F T F T T F F F T
T T T F F F T F T F T F T
F T T F F F T F T F T F T
T F T F F F T F T F T F T
F F T F F F F T T F T F T
T T F F F T T F F T T F T
F T F F F T T F F T F F T
T F F F F T T F F T T F T
F F F F F T F T F T F F T

6|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

IV. Proving Arguments

1. (n ∨ m) → p 2. j → k
(p ∨ q) → r k∨i
q∨n (i ∧ ∼ j) → (m ∧ ∼ j)
∼q ∼k
∴r ∴m

STEPS STATEMENTS REASONS STEPS STATEMENTS REASONS

1. qvn Given 1. j→k Given
2. ~q Given 2. ~j v k Material Implication (1)
3. n Disjunctive Syllogism (1, 2) 3. kvi Given
4. (n v m) → p Given 4. k v (~j ∧ i) Distributive Laws (2, 3)
5. (n → p) ᴧ (m → p) Proof by Cases (4) 5. ~k Given
6. (n → p) Law of Simplification (5) 6. ~j ∧ i Disjunctive Syllogism (4, 5)
7. p Modus Ponens (3, 6) 7. (i ∧ ∼ j) → (m ∧ ∼ j) Given
8. (p ∨ q) → r Given 8. m∧∼j Modus Ponens (6, 7)
9. (p → r) ᴧ (q → r) Proof by Cases (8) 9. ∴m Law of Simplification (8)
10. (p → r) Law of Simplification (9)
11. ∴r Modus Ponens (7, 10)

7|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

3. Argument:
If a matrix is diagonal, then it is symmetric. It is not true that either the
matrix is symmetric, or it is invertible. The matrix is either diagonal or 4. Argument:
upper triangular. Therefore, the matrix is upper triangular. If Albert is either fishing or biking, then it is not raining. Albert is either
fishing or cooking barbecue. However, he decided not to cook
If a matrix is diagonal, then it is symmetric. barbecue. Therefore, it is not true that either it is raining or Albert is
It is not true that either the matrix is symmetric, or it is invertible. cooking barbecue.
The matrix is either diagonal or upper triangular.
∴ The matrix is upper triangular. If Albert is either fishing or biking, then it is not raining.
Albert is either fishing or cooking barbecue.
Let: However, he decided not to cook barbecue.
D = Matrix is diagonal. ∴ It is not true that either it is raining or Albert is cooking barbecue.
S = Matrix is symmetric.
I = Matrix is invertible. Let:
T = Matrix is upper triangular. F = Albert is fishing.
B = Albert is biking.
Argument (Symbols): R = It is raining.
[(D → S) ∧ (~(S v I)) ∧ (D v T)] ⇒ T C = Albert is cooking barbeque.

Vertical Form: Argument (Symbols):

D→S [((F v B) → (~R)) ∧ (F v C) ∧ (~C)] ⇒ (~(R v C))
~(S v I)
DvT Vertical Form:
∴T (F v B) → (~R)
FvC
~C
∴ ~(R v C)

8|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

For #3.: STEPS STATEMENTS REASONS

1. ~(S v I) Given
D→S 2. (~S) ∧ (~I) De Morgan’s Laws (1)
~(S v I) ~S Law of Simplification (2)
3.
DvT D→S
4. Given
∴T
5. ~D Modus Tollens (3, 4)
Proof: 6. DvT Given
7. ∴T Disjunctive Syllogism (5, 6)

For #4.: STEPS STATEMENTS REASONS

1. (F v B) → (~R) Given
(F v B) → (~R) 2. (F → (~R)) ∧ (B → (~R)) Proof by Cases (1)
FvC F → (~R) Law of Simplification (2)
3.
~C FvC
4. Given
∴ ~(R v C)
5. ~C Given
Proof: 6. F Disjunctive Syllogism (4, 5)
7. ~R Modus Ponens (3, 6)
8. (~R) ∧ (~C) Law of Conjunction (5, 7)
9. ∴~ (R v C) De Morgan’s Laws (8)

9|Assessment in Reasoning Mathematics

John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

Homework #1: October 31, 2020

I. True or False (This part is exactly similar to the one included in the part one of this documents (page 1))
1. ~q, FALSE
2. ~p, FALSE
3. p ↔ q, TRUE
4. ~p ^ ~q, FALSE
5. r v p, TRUE
6. (~r) → q, TRUE
7. r → (~p), TRUE
8. q ^ (~r), TRUE
9. r → (p v q), TRUE
10. (q ^ r) → p, TRUE

Truth Tables

• Conditional Statement: p → q
• Converse: q → p
• Inverse: (~p) → (~q)
• Contrapositive: (~q) → (~p)

p q ~p ~q p→q q→p (~p) → (~q) (~q) → (~p)

T T F F T T T T
F T T F T F F T
T F F T F T T F
F F T T T T T T

10 | A s s e s s m e n t i n R e a s o n i n g M a t h e m a t i c s
John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

Homework #2: November 2, 2020

11 | A s s e s s m e n t i n R e a s o n i n g M a t h e m a t i c s
John Alexis A. Cabolis | BS Statistics 1-1 MATH 20033: Reasoning Mathematics | Ma’am Aurea Rosal

Homework #3: December 8, 2020

Truth Table: ((p ᴧ q) ᴧ s ᴧ (~t)) → (~p)

12 | A s s e s s m e n t i n R e a s o n i n g M a t h e m a t i c s