The gates $NOT$ and any one from $\{AND, OR\}$ are functionally complete. In other words, we can use these to represent any boolean function $f: (\{0, 1\}^n) \to \{0, 1\}$.
Thus, they for a universal set of gates.