Conjunction (AND)
What You'll Learn
You'll learn how the conjunction operator combines two propositions and construct truth tables to see when a conjunction is true.
Core Idea
In logic, a conjunction joins two propositions with "AND" (symbolized as ∧). The resulting compound proposition is true only when both original propositions are true—if either one is false, the entire conjunction is false.
Think of it like a series electrical circuit: current flows through only if both switches are closed. One open switch breaks the whole circuit.
The Conjunction Operator
Given two propositions p and q, the conjunction p ∧ q (read as "p and q") follows this rule:
- True when both p is true AND q is true
- False in all other cases (when either or both are false)
Truth Table for Conjunction
Here's the complete truth table:
| p | q | p ∧ q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | F |
| F | F | F |
Notice that only the first row yields true—where both inputs are true.
Example
Let:
- p: "It is raining"
- q: "I have an umbrella"
Then p ∧ q: "It is raining AND I have an umbrella"
This compound statement is true only when both conditions hold simultaneously. If it's not raining, or if you don't have an umbrella (or both), the conjunction is false.
Why It Matters
Conjunction is fundamental in mathematical proofs and logical reasoning. When we need to verify that multiple conditions hold, we're checking a conjunction.
Key Takeaway: A conjunction p ∧ q is true if and only if both p and q are true; otherwise, it's false.