Rules of Inference and Replacement
Replacement Rules
Recognize the rule
Name the Rule
Determine the rule
100

 P ⊃ Q 

∴ Q

Modus Ponens

100

~ (P • Q) becomes ~P ∨ ~Q

De Morgan’s Theorems

100

P • Q 

∴ P

Simplification

100

From (P) derive P ∨ Q

Addition

100

P ⊃ Q 

Q

∴ P

Affirming the Consequent

200

P ⊃Q

Q ⊃ R

∴ P ⊃ R

Hypothetical Syllogism

200

~ ~ P becomes P

Double Negation

200

P ∨ Q 

~ P

∴ Q  

Disjunctive Syllogism

200

P • Q becomes Q • P

Commutation

200

P ⊃ Q 

~P 

∴ ~Q

Denying the Antecedent

300

P

Q

∴ P • Q

Conjunction

300

(P ⊃ Q) becomes (~P ∨ Q)

Material Implication

300

P ⊃ Q 

~ Q 

∴ ~ P

Modus Tollens

300

(P • Q) • R becomes P • (Q • R)

Association

300

P ∨ Q 

∴ Q

Affirming a Disjunct

400

(P ⊃ Q) • (R ⊃ S) 

P v R

∴ Q ∨ S

Constructive Dilemma

400

~ (P ∨ Q) becomes (~P • ~Q)

De Morgan’s Theorems

400

(P ≡ Q) ≡ [(P ⊃ Q) • (Q ⊃ P)]

Material Equivalence

400

P ⊃ Q becomes ~Q ⊃ ~P

Transposition

400

P ∨ Q 

Q

∴ P

Affirming a Disjunct

500

(P ⊃ R) • (Q ⊃ S) 

P v Q

∴ R ∨ S

Constructive Dilemma

500

P ∨ (Q • R) becomes (P ∨ Q) • (P ∨ R)

Distribution

500

P • (Q ⊃ R) 

∴ P

Simplification

500

P • P becomes P

Tautology

500

P ⊃ Q 

Q ⊃ R

R

 ∴ P

Affirming the Consequent (chained reasoning)