Sole sufficient operator

From Wikipedia, the free encyclopedia

It has been suggested that this article or section be merged into functional completeness. (Discuss)

A sole sufficient operator or a sole sufficient connective is an operator that is sufficient by itself to generate all of the operators in a specified class of operators. In logic, it is a logical operator that suffices to generate all of the boolean-valued functions, $f : X \to \mathbb{B}$ , where $X\!$ is an arbitrary set and where $\mathbb{B}$ is a generic 2-element set, typically $\mathbb{B} = \{ 0, 1 \} = \{ \mathrm{false}, \mathrm{true} \}$ , in particular, to generate all of the finitary boolean functions, $f : \mathbb{B}^k \to \mathbb{B}$ .