You are on page 1of 7

FRIA MAE A.

ABELLANO
BSMAC-2
BLOCK E

TAUTOLOGIES
1. ( ¬p → ¬q ) V ( p → q )
p q ¬p ¬q ¬p → ¬q p→q ( ¬p → ¬q ) V ( p → q )
T T F F T T T
T F F T T F T
F T T F F T T
F F T T T T T

2. ( p ^ ¬q ) V (¬p ↔ q)
p q ¬p ¬q (p ^ ¬q) (¬p ↔ q) ( p ^ ¬q ) → (¬p ↔ q)
T T F F F F T
T F F T T T T
F T T F F T T
F F T T F F T

3. ¬ ( p V ¬q) V ( p V ¬q)
p q ¬q ( p V ¬q) ¬ ( p V ¬q) ¬ ( p V ¬q) V ( p V ¬q)
T T F T F T
T F T T F T
F T F F T T
F F T T F T

4. (¬p → ¬q) V (p V q)
p q ¬p ¬q (¬p → ¬q) (p V q) (¬p → ¬q) V (p V q)
T T F F T T T
T F F T T T T
F T T F F T T
F F T T T F T

5. ( p V ¬q) V (¬p ^ q)
P q ¬q ( p V ¬q) ¬p (¬p ^ q) ( p V ¬q) V (¬p ^ q)

T T F T F F T
T F T T F F T
F T F F T T T
F F T T T F T
FRIA MAE A. ABELLANO
BSMAC-2
BLOCK E

CONTRADICTIONS
1. (p ↔ q) ^ (p ^ ¬q)
p q ¬p ¬q (p ↔ q) (p ^ ¬q) (p ↔ q) ^ (p ^ ¬q)
T T F F T F F
T F F T F T F
F T T F F F F
F F T T T F F

2. ( p ^ q ) ^ ( ¬p ^ q)
p q ¬p ( p ^ q) ( ¬p ^ q) ( p ^ q ) ^ ( ¬p ^ q)
T T F T F F
T F F F F F
F T T F T F
F F T F F F

3. ¬ [( p V ¬q) V ( p V q)]
p q ¬q ( p V ¬q) ( p V q) ( p V ¬q) V ( p V q) ¬ [( p V ¬q) V ( p V q)]

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

4. (p ^ q) ^ ¬p
p q ¬p (p ^ q) (p ^ q) ^ ¬p
T T F T F
T F F F F
F T T F F
F F T F F
FRIA MAE A. ABELLANO
BSMAC-2
BLOCK E
5. (p ^ ¬q) ^ (p ^ q)
p q ¬q (p ^ ¬q) (p ^ q) (p ^ ¬q) ^ (p ^ q)

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

CONTIGENCY
1. (p ^ ¬q) → (p ↔ q)
p q ¬p ¬q (p ^ ¬q) (p ↔ q) (p ^ ¬q) → (p ↔ q)
T T F F F T T
T F F T T F F
F T T F F F T
F F T T F T T

2. (¬p → ¬q) V (p ^ ¬q)


p q ¬p ¬q (¬p → ¬q) (p ^ ¬q) (¬p → ¬q) V (p ^ ¬q)
T T F F T F T
T F F T T T T
F T T F F F F
F F T T T F T

3. (p V q) ^ (p ^ q)
p q (p V q) (p ^ q) (p V q) ^ (p ^ q)
T T T T T
T F T F F
F T T F F
F F F F F

4. (¬p ↔ q) ^ ( p → q)
p q ¬p (¬p ↔ q) ( p → q) (¬p ↔ q) ^ ( p → q)
T T F F T F
T F F T F F
F T T T T T
F F T F T F
FRIA MAE A. ABELLANO
BSMAC-2
BLOCK E

5. (p ^ q) ↔ (¬p ^ q)
p q ¬p (p ^ q) (¬p ^ q) (p ^ q) ↔ (¬p ^ q)
T T F T F F
T F F F F T
F T T F T F
F F T F F T

PROPOSITIONAL EQUIVALENT

1. ¬ ( p V ¬q ) & (¬p ^ q)
p q ¬p ¬q p V ¬q ¬(p V ¬q) (¬p ^ q )
T T F F T F F
T F F T T F F
F T T F F T T
F F T T T F F

2. (¬p ^ ¬q) & ¬ (p V q)


p q ¬p ¬q (p V q) ¬ (p V q) (¬p ^ ¬q)
T T F F T F F
T F F T T F F
F T T F T F F
F F T T F T T

3. ¬(p ^ q) & (¬p V ¬q)


p q ¬p ¬q (p ^ q) ¬(p ^ q) (¬p V ¬q)
T T F F T F F
T F F T F T T
F T T F F T T
F F T T F T T
FRIA MAE A. ABELLANO
BSMAC-2
BLOCK E
4. (¬p V ¬q) & ¬(p ^ q)
p q ¬p ¬q p^q ¬(p ^ q) (¬ p V ¬q)
T T F F T F F
T F F T F T T
F T T F F T T
F F T T F T T

5. (¬p → ¬q) & ( p ^ ¬q)


p q ¬p ¬q (¬p → ¬q) ( p ^ ¬q)
T T F F T T
T F F T T T
F T T F F F
F F T T T T

UNIVERSAL QUANTIFICATION

1. Let P(x) be the statement “3(x)² > x”

3(x)² > x 3(x)² > x


3(1)² > 1 3(2)² > 2
3(1) > 1 3(4) > 2
3 >1 ≡ T 12 >2 ≡ T

2. Let P(x) be the statement “x3/x3 = 1”

x3/x3 = 1 x3/x3 = 1
(1)3/(1)3 = 1 (2)3/(2)3 = 1
1/1 =1 8/8 = 1
1=1 ≡ T 1=1 ≡ T

3. Let P(x) be the statement “3x/3x = 1”

3x/3x = 1 3x/3x = 1
3(1)/3(1) = 1 3(2)/3(2) = 1
3/3 = 1 6/6 =1
1=1 ≡ T 1=1 ≡ T
FRIA MAE A. ABELLANO
BSMAC-2
BLOCK E
4. Let P(x) be the statement “3x–1 > x”

3x–1 > x 3x–1 > x


3(1)-1 > 1 3(2)-1 > 2
3-1 > 1 6-1>2
2>1≡T 5>2≡T

5. Let P(x) be the statement “3+x > x”

3+x > x 3+x > x


3+1 > 1 3+2 > 2
4>1≡T 5>1≡T

EXISTENTIAL QUANTIFICATION

1. Let P(x) be the statement “x3 < 10”

x3 < 10 x3 < 10 x3 < 10


(1)3 < 10 (2)3 < 10 (3)3 < 10
1 < 10 ≡ T 8 < 10 ≡ T 27 < 10 ≡ F

2. Let P(x) be the statement “4 = 3+x”

4 = 3+x 4 = 3+x 4 = 3+x


4=3+1 4=3+2 4=3+3
4=4≡T 4=5≡F 4=6≡F

3. Let P(x) be the statement “5x/5 = 1”

5x/5 = 1 5x/5 = 1 5x/5 = 1


5(1)/5 = 1 5(2)/5 = 1 5(3)/5 = 1
5/5 = 1 10/5 = 1 15/5 = 1
1=1≡T 2=1≡F 3=1≡F

4. Let P(x) be the statement “6x = 6”


FRIA MAE A. ABELLANO
BSMAC-2
BLOCK E

6x = 6 6x = 6 6x = 6
6(1) = 6 6(2) = 6 6(3) = 6
6=6≡T 12 = 6 ≡ F 18 = 6 ≡ F

5. Let P(x) be the statement “10x < 15”

10x < 15 10x < 15 10x < 15


10(1) < 15 10(2) < 15 10(4) < 15
10 < 15 ≡ T 20 < 15 ≡ F 40 < 15 ≡ F

You might also like