Definition:Functional Completeness

Propositional Calculus
Let $$F$$ be a set of logical connectives.

Then $$S$$ is functionally complete if all possible truth tables can be obtained by combining elements of $$S$$ into a statement form.

Also known as expressively adequate.