RULES OF INFERENCE (LOGICAL TOOLBOX)

ELEMENTARY VALID ARGUMENT LOGICALLY EQUIVALENT

FORMS EXPRESSIONS
19 rules of inference are specified for use 10) De Morgan’s Theorem (De M.)
in constructing formal proofs of = ~(p • q) ≡ (~p ∨ ~q)
validity. They are as follows: ~(p ∨ q) ≡ (~p • ~q)
1) Modus Ponens (M.P) 11) Commutation (Com.)
= p ⊃ q, = (p ∨ q) ≡ (q ∨ p)
p, (p • q) ≡ (q • p)
∴q
2) Modus Tollens (M.T.) 12) Association (Assoc.)
= p ⊃ q, = [(p v q) v r] ≡ [p v (q v r)]
~q, [(p • q) • r] ≡ [p • (q • r)]
∴q
3) Hypothetical Syllogism (H.S.) 13) Distribution (Dist.)
= p ⊃ q, = [p v (q • r)] ≡ [ (p v q) • (p v r)]
q ⊃ r, [p • (q v r)] ≡ [ (p • q) v (p • r)]
∴p⊃ r
4) Disjunctive Syllogism (D.S) 14) Double Negation (D.N.)
= p ∨ q,
~p, =p≡~~p
∴q
5) Constructive Dilemma (C.D.) 15) Transposition (Trans.)
= (p ⊃ q) • (r ⊃ s),
p ∨ r, = (p ⊃ q) ≡ (~ q ⊃ ~ p)
∴q∨ s
6) Absorption (Abs.) 16) Material Implication (Impl.)
= p ⊃ q, = (p ⊃ q) ≡ (~ p v q)
∴ p ⊃ (p • q)
7) Simplification (Simp.) 17) Material Equivalence (Equiv.)
= p • q, = (p ≡ q) ≡ [(p ⊃ q) • (q ⊃ p)]
∴p (p ≡ q) ≡ [(p • q) v (~ p • ~q)]
8) Conjunction (Conj.) 18) Exportation (Exp.)
= p,
q, = [(p • q)⊃ r)] ≡ [p ⊃ (q ⊃ r)]
∴p•q
9) Addition (Add.) 19) Tautology (Taut.)
= p, = p ≡ (p v p)
∴p∨ q p ≡ (p • p)