Conditional Statements (If-Then)
What You'll Learn
You'll learn how the implication operator works in logic and discover the surprising conditions under which "if p then q" is considered false.
The Implication Operator
In everyday language, we constantly make "if-then" statements: "If it rains, then I'll bring an umbrella." In logic, we formalize this as p → q (read "if p, then q" or "p implies q"), where p is called the hypothesis and q is the consequence.
The key question: when is this statement true, and when is it false?
The Truth Table
Here's where logic gets interesting:
| p | q | p → q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
The implication is false in exactly one case: when the hypothesis is true but the consequence is false.
Think of it as a promise. "If you do your homework (p), then you can go out (q)." The promise is only broken when you do finish your homework but are not allowed to go out. In all other cases—you didn't do homework at all, or you did it and got to go out—the promise hasn't been violated.
The counterintuitive rows are when p is false: the statement is considered vacuously true. If you never did your homework, the promise wasn't tested, so it can't be called false.
Why This Matters
This truth table forms the foundation of mathematical proof. When we prove "if p then q," we only need to worry about cases where p is actually true—and ensure q follows.
Key Takeaway: A conditional statement p → q is false only when p is true and q is false; in all other cases, including when p is false, the statement is considered true.