# Sole sufficient operator

MyWikiBiz, Author Your Legacy — Saturday December 04, 2021

Revision as of 00:43, 2 May 2010 by Jon Awbrey (talk | contribs) (+ [syllabus] + [document history])

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-end### Peer nodes

- Differential Logic @ Beta Wikiversity
- Differential Logic @ MyWikiBiz
- Differential Logic @ NetKnowledge
- Differential Logic @ SemanticWeb

### Logical operators

### Related topics

- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic