Propositional Logic

Thrm All boolean functions can be represented as a formula.

Def Expressively Complete
A set of logical connectives is expressively complete if it allows us to build all boolean functions.
e.g. The set $\{\wedge ,\vee ,\neg \}$ is expressively complete.