In a complicated argument with many variables, it is not practical to use truth tables because of their size. We can, however, use valid argument forms to reason without using truth tables. For example, consider the following argument:
We assume that all the premises are true, and we reason like this to prove that the argument is valid:
1. We assumed that p and p → q are both true, therefore by the law of detachment, we have that q is true.
2. Now both p and q are true, sop Λ q is also true.
3. By the law of detachment again, p Λ q true and p Λ q → r true force r to be true.
4. Because the statement ~ s → ~ r is equivalent to its contrapositive, we then know that r → s is true.
5. Knowing thatr and r → s are both true, we conclude that s is also true.
Therefore, by assuming that all the premises are true, we were able to reason that the conclusion s also must be true. This means that the argument is valid. In Exercise reason similarly to prove that each argument is valid.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.