Sole sufficient operator

From Ref
Revision as of 02:08, 23 June 2010 by Jon Awbrey (talk | contribs) (+ article)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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, , where is an arbitrary set and where is a generic 2-element set, typically , in particular, to generate all of the finitary boolean functions, .

Syllabus

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.