Inference Rules in Logic
Inference rules are principles of reasoning used to derive logical conclusions from premises. Below
are the most common inference rules with clear examples.
1. Modus Ponens (Law of Detachment)
If P → Q and P are true, then Q is true.
Example: If it rains (P), then the ground gets wet (Q). It rains → The ground gets wet.
2. Modus Tollens (Law of Contrapositive)
If P → Q and ¬Q are true, then ¬P is true.
Example: If it rains (P), then the ground gets wet (Q). The ground is not wet (¬Q) → It did not rain
(¬P).
3. Hypothetical Syllogism
If P → Q and Q → R, then P → R.
Example: If I study (P), I pass (Q). If I pass (Q), I graduate (R). Therefore, if I study, I graduate.
4. Disjunctive Syllogism
If P ∨ Q and ¬P, then Q.
Example: Either I will eat (P) or I will sleep (Q). I will not eat → I will sleep.
5. Simplification
From P ∧ Q, infer P or Q.
Example: It is raining and cold → It is raining.
6. Conjunction
If P and Q are both true, infer P ∧ Q.
Example: It is sunny (P). It is warm (Q). → It is sunny and warm.
7. Addition
From P, infer P ∨ Q.
Example: It is raining → It is raining or snowing.
8. Constructive Dilemma
(P → Q) ∧ (R → S), and (P ∨ R), therefore (Q ∨ S).
Example: If I study, I pass; if I play, I relax. I either study or play → I either pass or relax.
9. Destructive Dilemma
(P → Q) ∧ (R → S), and (¬Q ∨ ¬S), therefore (¬P ∨ ¬R).
Example: If I study, I pass; if I play, I relax. I will not pass or I will not relax → I did not study or I did
not play.