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

Contents 1 Syllabus 1.1 Focal nodes 1.2 Peer nodes 1.3 Logical operators 1.4 Related topics 1.5 Relational concepts 1.6 Information, Inquiry 1.7 Related articles 2 Document history

[edit] Syllabus

[edit] Focal nodes

Inquiry Live

Logic Live

[edit] Peer 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

[edit] Logical operators

Exclusive disjunction Logical conjunction Logical disjunction Logical equality

Logical implication Logical NAND Logical NNOR Negation

[edit] Related topics

Ampheck Boolean domain Boolean function Boolean-valued function Differential logic

Logical graph Minimal negation operator Multigrade operator Parametric operator Peirce's law

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

[edit] Relational concepts

Continuous predicate Hypostatic abstraction Logic of relatives Logical matrix

Relation Relation composition Relation construction Relation reduction

Relation theory Relative term Sign relation Triadic relation

[edit] Information, Inquiry

Inquiry Dynamics of inquiry

Semeiotic Logic of information

Descriptive science Normative science

Pragmatic maxim Truth theory

[edit] Related articles

• Jon Awbrey, “Semiotic Information”

• Jon Awbrey, “Introduction To Inquiry Driven Systems”

• Jon Awbrey, “Prospects For Inquiry Driven Systems”

• Jon Awbrey, “Inquiry Driven Systems : Inquiry Into Inquiry”

• Jon Awbrey, “Propositional Equation Reasoning Systems”

• Jon Awbrey, “Differential Logic : Introduction”

• Jon Awbrey, “Differential Propositional Calculus”

• Jon Awbrey, “Differential Logic and Dynamic Systems”

[edit] 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