12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Sunday February 16, 2025
Jump to navigationJump to search<font size="3">☞</font> This page belongs to resource collections on Logic and Inquiry.
<font size="3">☞</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].
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>.
