12,080
edits
Changes
copy text from [http://www.opencycle.net/ OpenCycle] of which Jon Awbrey is the sole author
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 function]]s, <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 function]]s, <math> f : \mathbb{B}^k \to \mathbb{B} </math>.
==References==
==See also==
{|
| valign=top |
* [[Ampheck]]
* [[Entitative graph]]
* [[Existential graph]]
| valign=top |
* [[Logical graph]]
* [[Logical NAND]]
* [[Logical NNOR]]
| valign=top |
* [[Minimal negation operator]]
* [[Multigrade operator]]
* [[Parametric operator]]
|}
==References==
==See also==
{|
| valign=top |
* [[Ampheck]]
* [[Entitative graph]]
* [[Existential graph]]
| valign=top |
* [[Logical graph]]
* [[Logical NAND]]
* [[Logical NNOR]]
| valign=top |
* [[Minimal negation operator]]
* [[Multigrade operator]]
* [[Parametric operator]]
|}