In propositional logic, conjunction (AND, ∧) and disjunction (OR, ∨) are binary connectives with precise truth conditions.
True only when both p and q are true.
| p | q | p ∧ q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | F |
| F | F | F |
Example: "It is sunny and warm" — true only if both conditions hold.
True when at least one of p, q is true (inclusive OR).
| p | q | p ∨ q |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | T |
| F | F | F |
Example: "It is sunny or cloudy" — true if either (or both) occurs.
Everyday "or" can be exclusive (XOR) — "tea or coffee?" — but logic defaults to inclusive unless specified otherwise.