Propositions and Truth Tables
A proposition is a declarative sentence that is either true (T) or false (F)—not both.
Examples:
Propositions are represented by symbols like , and are the building blocks of propositional logic.
Logical connectives are used to form compound propositions from simple ones. The main ones are:
| Symbol | Operation | Meaning |
|---|---|---|
| Negation | Not | |
| Conjunction | and | |
| Disjunction | or | |
| Implication | If , then | |
| Biconditional | if and only if | |
| Exclusive OR | or , but not both |
A truth table shows all possible truth values of a compound proposition based on the truth values of its components.
| p | ¬p |
|---|---|
| T | F |
| F | T |
| p | q | p ∧ q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | F |
| F | F | F |
| p | q | p ∨ q |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | T |
| F | F | F |
| p | q | p → q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
| p | q | p ↔ q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | F |
| F | F | T |
| p | q | p ⊕ q |
|---|---|---|
| T | T | F |
| T | F | T |
| F | T | T |
| F | F | F |
Example: Construct the truth table for
| p | q | ¬p | p ∨ q | (p ∨ q) ∧ ¬p |
|---|---|---|---|---|
| T | T | F | T | F |
| T | F | F | T | F |
| F | T | T | T | T |
| F | F | T | F | F |
For propositional variables, the truth table has rows.
Open this section to load past papers