Table 2.3.1 (p.61) Valid Argument Forms
Modus Ponens	p → q p ∴ q
Modus Tollens	p → q ~ q ∴ ~ p
Generalization	p ∴ p ∨ q
Specialization	p ∧ q ∴ p
Conjunction	p q ∴ p ∧ q
Elimination	p ∨ q ~ q ∴ p
Transitivity	p → q q → r ∴ p → r
Proof by Division into Cases	p ∨ q p → r q → r ∴ r
Contradiction Rule	~ p → c ∴ p
Invalid Argument Forms
Converse Error	p → q q ∴ p
Inverse Error	p → q ~ p ∴ ~ q