Translate the following argument and use truth tables to


Truth Table Exercises : Back-up QUESTION SET

1 Premise: P → Q
Conclusion: ~P → ~Q

2 Premise: P → Q
Conclusion: ~Q → ~P

3 Premise: (P & Q) → R
Q → R
Conclusion: P → R

4 Translate the following argument and use truth tables to test for validity.

"If 9 is less than 10 and every odd number less than 10 is divisible by 3, then 9 is divisible by 3. THEREFORE If 9 is less than 10 it is less than 10 it is divisible by 3."

N = "9 is less than 10"
O = "Every odd number less than 10 is divisible by 3."
D = "9 is divisible by 3."

Premise:
Conclusion:

4 Translate the following argument and use truth tables to test for validity.

"If 9 is less than 10 and every odd number less than 10 is divisible by 3, then 9 is divisible by 3. THEREFORE If 9 is less than 10 it is less than 10 it is divisible by 3."

N = "9 is less than 10"
O = "Every odd number less than 10 is divisible by 3."
D = "9 is divisible by 3."

Premise:
Conclusion:

Solution Preview :

Prepared by a verified Expert
Theory of Computation: Translate the following argument and use truth tables to
Reference No:- TGS02510515

Now Priced at $20 (50% Discount)

Recommended (93%)

Rated (4.5/5)