
I have seen functional-completeness (in regards to boolean functions) defined as:
A set X of truth-functions (of 2-valued logic) is functionally complete if and only if for each of the five defined classes, there is a member of X which does not belong to that class
With those 5 classes being:
...