Professional Documents
Culture Documents
PRELIMINARY EXAMINATION
Instructions:
B = { A, E, I, O, U }
B = { x |x are all the vowels in English alphabet }
C = {1, 3, 5, 7, 9 }
C = {x|x ∈ N is an odd number and x < 10}
E = { …, -2, -1, 0, 1, 2, … }
E = { x|x ∈ Z }
2. Set Builder to tabular form
Set Builder Notation Roster or Tabular Form
A = { x | x is consonants in English alphabet }
A = {b, c, d, f, g, h, j, k, l, m, n, p, q, r, s, t, v, w, x,
y, z}
B = { x | x ϵ N, 0 < x < 5 }
B = {1,2,3,4}
C = { x | x ϵ Z and x = ∞ }
C = {…, -2, -1, 0, 1, 2, …}
II. Create Truth table (5 points each) also determine if the statements are Tautology,
Contradiction or Contingency (1 point each).
1. A ^ B ^ C - Contingency
A B C A^B A^B^C
T T T T T
T T F T F
T F T F F
T F F F F
F T T F F
F T F F F
F F T F F
F F F F F
2. ( ¬A → B ) → ¬( A v C ) - Contingency
A B C ¬A (¬A → Av ¬( A v ( ¬A → B ) → ¬( A v
B) C C) C)
T T T F T T F F
T T F F T T F F
T F T F T T F F
T F F F T T F F
F T T T T T F F
F T F T T F T T
F F T T F T F T
F F F T F F T T
3. ¬ (A ^ ¬C ) → B - Contingency
A B C ¬C A^ ¬ (A ^ ¬ (A ^ ¬C ) → B
¬C ¬C )
T T T F F T T
T T F T T F T
T F T F F T F
T F F T T F T
F T T F F T T
F T F T F T T
F F T F F T F
F F F T F T F
4. (A ^ A) → (B v B) ^ ¬( C ⇔ D) - Contingency
A B C D A^ BvB (A ^ A) → (B v C⇔ ¬(C ⇔ D)
A B) D
T T T T T T T T F
T T T F T T T F T
T T F T T T T F T
T T F F T T T T F
T F T T T F F T F
T F T F T F F F T
T F F T T F F F T
T F F F T F F T F
F T T T F T T T F
F T T F F T T F T
F T F T F T T F T
F T F F F T T T F
F F T T F F T T F
F F T F F F T F T
F F F T F F T F T
F F F F F F T T F
(A ^ A) → (B v B) ^ ¬( C ⇔ D)
F
T
T
F
F
F
F
F
F
T
T
F
F
T
T
F
5. ¬ A - Contingency
A ¬A
T F
F T
III. Prove if the conclusion is possible to the following premises. (5points each)
1. (A → B)
¬A → C
¬C________
:. B
1 A→B Premises
2 ¬A → C Premises
3 ¬C Premises
4 A 2, 3 Modus Tollens
5 :. B 1, 4 Modus Ponens
2. P →Q
R→S
¬Q v S_______
:. P v R
1 P→Q Premises
2 R→S Premises
3 ¬Q v S Premises
4 (P → Q) ^ (R → 1, 2 Conjunction
S)
5 :. ¬P v R 4, 3 Destructive Dilemma
Not Possible
3. A
A→B
B → ¬C_____
:. ¬C
1 A→ Premises
2 A→B Premises
3 B → ¬C Premises
4 A → ¬C 2, 3 Hypothetical Syllogism
5 :. ¬C 3, 1 Modus Ponens
4. ( ¬A v ¬B ) → C ^ D
C→E
¬E______________
:. A
1 ¬A v ¬B → C ^ D Premises
2 C→E Premises
3 ¬E Premises
4 ¬C 2, 3 Modus Tollens
5 ¬(C ^ D) → ( ¬A v ¬B) 1 Contrapositive
6 (¬C v ¬D) → (¬¬A ^ 5 Demorgans Law
¬¬B)
7 (¬C v ¬D) → (A ^ B) 6 Double Negation
8 ¬C v ¬D 4 Addition
9 A^B 7, 8 Modus Ponens
10 :. A 9 Simplification
5. ¬P ^ Q
R →P
¬R → S
S →T____
:. T
1 ¬P ^ Q Premises
2 R →P Premises
3 ¬R → S Premises
4 S →T Premises
5 ¬P 1 Simplification
6 ¬R 2, 5 Modus Tollens
7 S 3, 6 Modus Ponens
8 :. T 4, 7 Modus Ponens