Adequacy/sufficiency/completeness of a set of boolean operators to
encode Boolean functions. 

SAT is the set of satisfiable wffs 
Complexity of SAT, P, NP