Sole sufficient operator

From Wikinfo

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

References

See also

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

References

• Adapted from the Wikipedia article, "Sole_sufficient_operator" http://en.wikipedia.org/wiki/Sole_sufficient_operator, used under the GNU Free Documentation License