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\; \backslash to\; \backslash mathbb\{B\}$, where $X\backslash !$ is an arbitrary set and where $\backslash mathbb\{B\}$ is a generic 2-element set, typically $\backslash mathbb\{B\}\; =\; \backslash \{\; 0,\; 1\; \backslash \}\; =\; \backslash \{\; false,\; true\; \backslash \}$, in particular, to generate all of the finitary boolean functions, $f\; :\; \backslash mathbb\{B\}^k\; \backslash to\; \backslash mathbb\{B\}$.

References

See also

• Ampheck
• Logical graphs
• Peirce arrow = NOR
• Sheffer stroke = NAND

Logic | Mathematical logic