Disjunctive normal form

Remarks

Example: $(p \wedge \neg q) \vee (q \wedge r) \vee \neg p$ is in disjunctive normal form. Every formula is logically equivalent to a formula in disjunctive normal form. For a formula that is not a contradiction, take one conjunction for each row of the truth table where it is true. A consequence: the connectives $\wedge$, $\vee$ and $\neg$ are functionally complete.