0% found this document useful (0 votes)
70 views

April 13 - Lecture - Part2 - Solution - 6.3

The document contains examples of using truth tables to determine logical relationships between symbolic statements. It analyzes whether statement pairs are tautologies, self-contradictions, contingent, logically equivalent, inconsistent, or consistent. One example shows the statements "(M ⊃ P) v (P ⊃ M)" are a tautology, while "(S ⊃ R) • (S • –R)" is a self-contradiction. Another pair, "–K ⊃ L" and "K⊃– L", are determined to be a consistent pair.

Uploaded by

Ashar Ismail
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
70 views

April 13 - Lecture - Part2 - Solution - 6.3

The document contains examples of using truth tables to determine logical relationships between symbolic statements. It analyzes whether statement pairs are tautologies, self-contradictions, contingent, logically equivalent, inconsistent, or consistent. One example shows the statements "(M ⊃ P) v (P ⊃ M)" are a tautology, while "(S ⊃ R) • (S • –R)" is a self-contradiction. Another pair, "–K ⊃ L" and "K⊃– L", are determined to be a consistent pair.

Uploaded by

Ashar Ismail
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

April 13, 2020_Lecture

EXERCISE 6.3
I. Use truth tables to determine whether the following symbolized statements are tautologous, self-contradictory, or contingent:
1. N ⊃ (N ⊃ N)

N (N ⊃ N) N ⊃ (N ⊃ N)

T T T
F T T

Answer: Tautology [There are two possibilities; and it true in both possibilities]

2. (G ⊃ G) ⊃ G
G (G ⊃ G) (G ⊃ G) ⊃ G

T T T
F T F
Answer: Contingent [can be true or false depending on the situation]. It is true when G is true, false when G is false.

3. (S ⊃ R) • (S • –R)
S R –R (S ⊃ R) (S • –R) (S ⊃ R) • (S • –R)

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

Answer: Self-contradictory [There are 4 possible cases (situations). It is false in every possible situation]

4. [(E ⊃ F) ⊃ F] ⊃ E
Solved example
5. (–K ⊃ H) ≡ – (H v K)
K H –K (–K⊃ H) HvK –(H v K) (–K ⊃ H) ≡ – (H v K)

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

Answer: Self-Contradictory

5. (M ⊃ P) v (P ⊃ M)
M P (M ⊃ P) (P ⊃ M) (M ⊃ P) v (P ⊃ M)

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

Answer: Tautologous

7. [(Z ⊃ X) • (X v Z)] ⊃ X [solved in the book]


8. [(C ⊃ D) • –C] ⊃ –D
C D –C –D (C ⊃ D) [(C ⊃ D) • –C] [(C ⊃ D) • –C] ⊃ –D
T T F F T F T
T F F T F F T
F T T F T T F

Answer: Contingent [since both ‘true’ and ‘false’ values are present in the last column, it is
contingent. No need to do the last row. If you do it, there is no harm.]

II. Use truth tables to determine whether the following pairs of symbolized statements are logically equivalent, contradictory,
consistent, or inconsistent. First determine whether the pairs of propositions are logically equivalent or contradictory; then, if these
relations do not apply, determine if they are consistent or inconsistent.
1. –D v B – (D • –B)

D B –D –B (D • –B) – (D • –B) –D v B
T T F F F T T
T F F T T F F
F T T F F T T
F F T T F T T

Answer: They are logically equivalent

2. F • M – (F v M )
F M FvM – (F v M ) F•M
T T T F T
T F T F F
F T T F F
F F F T F

Answer: Inconsistent pair [both of them are not true in the same row. Both of them are false in row2 and row3].

3. – K ⊃L K⊃– L

K L –K –L – K ⊃L K ⊃ – L
T T F F T F
T F F T T T
F T T F T T
F F T T F T

Answer: Consistent pair [Both propositions are true in row 2, row3]


4. R v – S S•–R
R S –R –S R v – S S • – R
T T F F T F
T F F T T F
F T T F F T
F F T T T F

Answer: Contradictory pair
[They have opposite values in each row]

9. M ⊃ (K ⊃ P) (K • M) ⊃ P
M K P (K ⊃ P) (K • M) M ⊃ (K ⊃ P) (K • M) ⊃ P

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

Answer: Logically equivalent

Try the rest. [Note: You may leave the last question of exercise 6.3.]

You might also like