Complete Set of Boolean Connectives

Definition

A set $C$ of Logical Connectives is complete $⟺$ every Boolean Function can be represented by a Formula Representing Boolean Function that uses only connectives in $C$.

Examples

• $\{\neg ,\wedge \}$ is complete
• $\{\neg ,\vee \}$ is complete

Uses Only Connectives

$F\text{ uoc }C$ means $F$ only uses connectives from $C$