Sole sufficient operator
☞ This page belongs to resource collections on Logic and 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 functions, \(f : X \to \mathbb{B} \), where \(X\!\) is an arbitrary set and where \(\mathbb{B}\) is a generic 2-element set, typically \(\mathbb{B} = \{ 0, 1 \} = \{ false, true \}\), in particular, to generate all of the finitary boolean functions, \( f : \mathbb{B}^k \to \mathbb{B} \).
Syllabus
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
- Sole Sufficient Operator @ MyWikiBiz
- Sole Sufficient Operator @ MathWeb Wiki
- Sole Sufficient Operator @ NetKnowledge
- Sole Sufficient Operator @ OER Commons
- Sole Sufficient Operator @ P2P Foundation
- Sole Sufficient Operator @ SemanticWeb
- Sole Sufficient Operator @ Subject Wikis
- Sole Sufficient Operator @ Wikiversity Beta
Logical operators
Related topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
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.
- Sole Sufficient Operator, MyWikiBiz
- Sole Sufficient Operator, MathWeb Wiki
- Sole Sufficient Operator, NetKnowledge
- Sole Sufficient Operator, P2P Foundation
- Sole Sufficient Operator, PlanetMath
- Sole Sufficient Operator, PlanetPhysics
- Sole Sufficient Operator, SemanticWeb
- Sole Sufficient Operator, Wikiversity Beta
- Sole Sufficient Operator, GetWiki
- Sole Sufficient Operator, Wikinfo
- Sole Sufficient Operator, Textop Wiki
- Sole Sufficient Operator, Wikipedia
<sharethis />
