A Formal Proof of Validity is a step-by-step deduction where each step follows logically from previous steps using established rules. While Truth Tables (Unit 4) are effective for small arguments, they become too complex for arguments with many variables. Formal proof offers a more elegant and direct method of demonstration.
A formal proof is a sequence of statements, each of which is either a premise or is derived from preceding statements by a rule of inference, ending with the conclusion.
These rules are the "logical building blocks" of any proof. Each rule represents an elementary argument form that is always valid.
| Rule Name | Abbreviation | Logical Structure |
|---|---|---|
| 1. Modus Ponens | M.P. | p ¹ q, p / ∴ q |
| 2. Modus Tollens | M.T. | p ¹ q, ~q / ∴ ~p |
| 3. Hypothetical Syllogism | H.S. | p ¹ q, q ¹ r / ∴ p ¹ r |
| 4. Disjunctive Syllogism | D.S. | p v q, ~p / ∴ q |
| 5. Constructive Dilemma | C.D. | (p¹q)•(r¹s), p v r / ∴ q v s |
| 6. Absorption | Abs. | p ¹ q / ∴ p ¹ (p • q) |
| 7. Simplification | Simp. | p • q / ∴ p |
| 8. Conjunction | Conj. | p, q / ∴ p • q |
| 9. Addition | Add. | p / ∴ p v q |
To solve a problem in Unit 5, you must number each line and state the rule used. For example:
M.P. is forward-moving: if you have the "if" part (antecedent), you get the "then" part (consequent). M.T. is backward-moving: if you deny the "then" part, you must deny the "if" part.