Disjunction (OR)
What you'll learn: You'll understand how the logical OR operator works and when a compound statement formed with OR is true.
The Core Idea
In logic, a disjunction is a compound proposition formed by connecting two propositions with the word "or," symbolized as ∨. When you write p ∨ q (read as "p or q"), you're making a claim that's true whenever at least one of the propositions is true.
This is called an inclusive OR because it includes the case where both propositions are true. It's different from everyday English, where "or" sometimes means "one or the other, but not both" (exclusive or). In mathematics and formal logic, unless stated otherwise, OR is always inclusive.
Truth Conditions
The disjunction p ∨ q is:
- True when p is true and q is false
- True when p is false and q is true
- True when both p and q are true
- False only when both p and q are false
An Analogy
Think of a security system that triggers an alarm if either the door sensor detects motion or the window sensor detects motion (or both). The alarm activates as long as at least one sensor is triggered—it doesn't require both, but it also doesn't exclude both happening simultaneously.
Example
Let p: "It is raining" and q: "It is cold."
The disjunction p ∨ q means "It is raining or it is cold (or both)."
This statement is true on a rainy warm day, a dry cold day, or a rainy cold day. It's false only when it's neither raining nor cold.
Key Takeaway: A disjunction p ∨ q is true whenever at least one of the propositions is true; it fails only when both are false.