Quickly add a free MyWikiBiz directory listing!

Sole sufficient operator

MyWikiBiz, Author Your Legacy — Monday June 14, 2021
Jump to: navigation, search

This page belongs to resource collections on Logic and Inquiry.

A sole sufficient operator is an operator that is sufficient by itself to generate every operator in a specified class of operators.  In the context of logic, it is a logical operator that suffices to generate every boolean-valued function, \(f : X \to \mathbb{B},\!\) where \(X\!\) is an arbitrary set and where \(\mathbb{B}\!\) is a generic two-element set, typically \(\mathbb{B} = \{ 0, 1 \} = \{ \mathrm{false}, \mathrm{true} \},\!\) in particular, to generate every finitary boolean function, \(f : \mathbb{B}^k \to \mathbb{B}.\!\)


Focal nodes

Peer nodes

Logical operators

Related topics

Relational concepts

Information, Inquiry

Related articles

Document history

Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.