Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Use truth tables to test two arguments in , and .
For each argument, count the rows of the eight in which all its premises are true, and check the conclusion in those rows. Are both arguments valid? Argument B is the pattern behind every proof by cases. Explain why.
An argument is valid when its conclusion is true in every row where all premises are true. Valid forms: modus ponens, modus tollens, the chain rule, disjunctive syllogism. Fallacies: affirming the consequent and denying the antecedent.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Argument A. makes false. Then is true only if is false. Then is true only if is false. So exactly row, (F, F, F), has all premises true. There is true. Valid.
Step 2. Argument B. If were false, both and would force and false, and then would be false. So every row with all premises true has true. Those rows are T with T: (T, T, T), (T, F, T) and (F, T, T). That is rows, and the conclusion is true in each. Valid.
Step 3. Proof by cases. To prove , show that one of the cases , always holds (), and that each case leads to . Argument B says this is enough.
Answer: both are valid; A has row with true premises and B has .
Log in to join the discussion.
Loading…