Philosophy Formal Logic Questions
The truth table for disjunction, also known as logical OR, is as follows:
| P | Q | P ∨ Q |
|---|---|-------|
| T | T | T |
| T | F | T |
| F | T | T |
| F | F | F |
In this table, P and Q represent two propositions, and P ∨ Q represents their disjunction. The disjunction is true (T) if at least one of the propositions is true, and false (F) only if both propositions are false.