Changes

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>.

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>.

==See also==

==Syllabus==

 

===Focal nodes===

{{col-begin}}

{{col-begin}}

{{col-break}}

{{col-break}}

* [[Ampheck]]

* [[Inquiry Live]]

* [[Entitative graph]]

* [[Existential graph]]

 

 

 

 

* [[Logical conjunction]]

* [[Logical disjunction]]

* [[Logical equality]]

{{col-break}}

{{col-break}}

* [[Logical graph]]

* [[Logical implication]]

* [[Logical NAND]]

* [[Logical NAND]]

* [[Logical NNOR]]

* [[Logical NNOR]]

{{col-break}}

{{col-break}}

* [[Minimal negation operator]]

* [[Minimal negation operator]]

* [[Multigrade operator]]

* [[Multigrade operator]]

* [[Parametric operator]]

* [[Parametric operator]]

{{col-end}}

{{col-end}}