Course contentsShow
← Computer Science
Lesson 44 of 2,8722. Discrete Mathematics for CSFree lesson

Logical Inference Rules

Learn modus ponens, modus tollens, and other fundamental rules for deriving conclusions from premises.

Logical Inference Rules

What you'll learn: How to derive new true statements from statements you already know to be true.

What Are Inference Rules?

In logic, an inference rule is a pattern that lets you conclude something new from existing facts. Think of it like detective work: if you know certain clues are true, inference rules are the legal steps that let you deduce what must have happened.

These rules are the backbone of proving theorems, verifying programs, and building AI reasoning systems.

The Most Important Rules

Modus Ponens (Method of Affirming)

If you know "If P then Q" is true, and you know "P" is true, then you can conclude "Q" must be true.

Example: If it's raining, the ground is wet. It's raining. Therefore, the ground is wet.

Modus Tollens (Method of Denying)

If you know "If P then Q" is true, and you know "Q" is false, then you can conclude "P" must be false.

Example: If it's raining, the ground is wet. The ground is not wet. Therefore, it's not raining.

Hypothetical Syllogism (Chain Rule)

If "P implies Q" and "Q implies R" are both true, then "P implies R" is true.

Example: If I study, I pass. If I pass, I graduate. Therefore, if I study, I graduate.

Disjunctive Syllogism

If "P OR Q" is true, and P is false, then Q must be true.

Example: It's either raining or sunny. It's not raining. Therefore, it's sunny.

Why This Matters

Inference rules let computers and humans reason step-by-step from assumptions to conclusions without guessing. Every proof in mathematics and every automated reasoning system relies on these patterns.

Key Takeaway: Logical inference rules are precise patterns for deriving guaranteed-true conclusions from known facts—they're the building blocks of all formal reasoning.