Functional completeness

From Wikipedia, the free encyclopedia
  (Redirected from Sole sufficient operator)
Jump to: navigation, search

In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.[1][2] A well-known complete set of connectives is { AND, NOT }, consisting of binary conjunction and negation. The singleton sets { NAND } and { NOR } are also functionally complete.

In a context of propositional logic, functionally complete sets of connectives are also called (expressively) adequate.[3]

From the point of view of digital electronics, functional completeness means that every possible logic gate can be realized as a network of gates of the types prescribed by the set. In particular, all logic gates can be assembled from either only binary NAND gates, or only binary NOR gates.


Modern texts on logic typically take as primitive some subset of the connectives: conjunction (); disjunction (); negation (); material conditional (); and possibly the biconditional (). Further connectives can be defined, if so desired, by defining them in terms of these primitives. For example, NOR (sometimes denoted , the negation of the disjunction) can be expressed as conjunction of two negations:

Similarly, the negation of the conjunction, NAND (sometimes denoted as ), can be defined in terms of disjunction and negation. It turns out that every binary connective can be defined in terms of , so this set is functionally complete.

However, it still contains some redundancy: this set is not a minimal functionally complete set, because the conditional and biconditional can be defined in terms of the other connectives as

It follows that the smaller set is also functionally complete. But this is still not minimal, as can be defined as

Alternatively, may be defined in terms of in a similar manner, or may be defined in terms of :

No further simplifications are possible. Hence, every two-element set of connectives containing and one of is a minimal functionally complete subsets of .

Formal definition[edit]

Given the Boolean domain B = {0,1}, a set F of Boolean functions ƒiBni → B is functionally complete if the clone on B generated by the basic functions ƒi contains all functions ƒBn → B, for all strictly positive integers n ≥ 1. In other words, the set is functionally complete if every Boolean function that takes at least one variable can be expressed in terms of the functions ƒi. Since every Boolean function of at least one variable can be expressed in terms of binary Boolean functions, F is functionally complete if and only if every binary Boolean function can be expressed in terms of the functions in F.

A more natural condition would be that the clone generated by F consist of all functions ƒBn → B, for all integers n ≥ 0. However, the examples given above are not functionally complete in this stronger sense because it is not possible to write a nullary function, i.e. a constant expression, in terms of F if F itself does not contain at least one nullary function. With this stronger definition, the smallest functionally complete sets would have 2 elements.

Another natural condition would be that the clone generated by F together with the two nullary constant functions be functionally complete or, equivalently, functionally complete in the strong sense of the previous paragraph. The example of the Boolean function given by S(xyz) = z if x = y and S(xyz) = x otherwise shows that this condition is strictly weaker than functional completeness.[4][5][6]

Characterization of functional completeness[edit]

Further information: Post's lattice

Emil Post proved that a set of logical connectives is functionally complete if and only if it is not a subset of any of the following sets of connectives:

  • The monotonic connectives; changing the truth value of any connected variables from F to T without changing any from T to F never makes these connectives change their return value from T to F, e.g. .
  • The affine connectives, such that each connected variable either always or never affects the truth value these connectives return, e.g. .
  • The self-dual connectives, which are equal to their own de Morgan dual; if the truth values of all variables are reversed, so is the truth value these connectives return, e.g. , MAJ(p,q,r).
  • The truth-preserving connectives; they return the truth value T under any interpretation which assigns T to all variables, e.g. .
  • The falsity-preserving connectives; they return the truth value F under any interpretation which assigns F to all variables, e.g. .

In fact, Post gave a complete description of the lattice of all clones (sets of operations closed under composition and containing all projections) on the two-element set {T, F}, nowadays called Post's lattice, which implies the above result as a simple corollary: the five mentioned sets of connectives are exactly the maximal clones.

Minimal functionally complete operator sets[edit]

When a single logical connective or Boolean operator is functionally complete by itself, it is called a Sheffer function[7] or sometimes a sole sufficient operator. There are no unary operators with this property. NAND and NOR , which are dual to each other, are the only two binary Sheffer functions. These were discovered, but not published, by Charles Sanders Peirce around 1880, and rediscovered independently and published by Henry M. Sheffer in 1913.[8] In digital electronics terminology, the binary NAND gate and the binary NOR gate are the only binary universal logic gates.

The following are the minimal functionally complete sets of logical connectives with arity ≤ 2:[9]

One element
{↑}, {↓}.
Two elements
, , , , , , , , , , , , , , , , , .
Three elements
, , , , , .

There are no minimal functionally complete sets of more than three at most binary logical connectives.[9] In order to keep the lists above readable, operators that ignore one or more inputs have been omitted. For example, an operator that ignores the first input and outputs the negation of the second could be substituted for a unary negation.


  • Examples of using the NAND(↑) completeness. As illustrated by,[10]
    • ¬A = A ↑ A
    • A ∧ B = ¬(A ↑ B) = (A ↑ B) ↑ (A ↑ B)
    • A ∨ B = (A ↑ A) ↑ (B ↑ B)
  • Examples of using the NOR(↓) completeness. As illustrated by,[11]
    • ¬A = A ↓ A
    • A ∧ B = (A ↓ A) ↓ (B ↓ B)
    • A ∨ B = ¬(A ↓ B) = (A ↓ B) ↓ (A ↓ B)

Note that, an electronic circuit or a software function is optimized by the reuse, that reduce the number of gates. For instance, the "A ∧ B" operation, when expressed by ↑ gates, is implemented with the reuse of "A ↑ B",

X = (A ↑ B); A ∧ B = X ↑ X

In other domains[edit]

Apart from logical connectives (Boolean operators), functional completeness can be introduced in other domains. For example, a set of reversible gates is called functionally complete, if it can express every reversible operator.

The 3-input Fredkin gate is functionally complete reversible gate by itself – a sole sufficient operator. There are many other three-input universal logic gates, such as the Toffoli gate.

Set theory[edit]

There is an isomorphism between the algebra of sets and the Boolean algebra, that is, they have the same structure. Then, if we map boolean operators into set operators, the "translated" above text are valid also for sets: there are many "minimal complete set of set-theory operators" that can generate any other set relations. The more popular "Minimal complete operator sets" are {¬, ∩} and {¬, ∪}.

See also[edit]


  1. ^ Enderton, Herbert (2001), A mathematical introduction to logic (2nd ed.), Boston, MA: Academic Press, ISBN 978-0-12-238452-3 . ("Complete set of logical connectives").
  2. ^ Nolt, John; Rohatyn, Dennis; Varzi, Achille (1998), Schaum's outline of theory and problems of logic (2nd ed.), New York: McGraw–Hill, ISBN 978-0-07-046649-4 . ("[F]unctional completeness of [a] set of logical operators").
  3. ^ Smith, Peter (2003), An introduction to formal logic, Cambridge University Press, ISBN 978-0-521-00804-4 . (Defines "expressively adequate", shortened to "adequate set of connectives" in a section heading.)
  4. ^ Wesselkamper, T.C. (1975), "A sole sufficient operator", Notre Dame Journal of Formal Logic, 16: 86–88, doi:10.1305/ndjfl/1093891614 
  5. ^ Massey, G.J. (1975), "Concerning an alleged Sheffer function", Notre Dame Journal of Formal Logic, 16 (4): 549–550, doi:10.1305/ndjfl/1093891898 
  6. ^ Wesselkamper, T.C. (1975), "A Correction To My Paper" A. Sole Sufficient Operator", Notre Dame Journal of Formal Logic, 16 (4): 551, doi:10.1305/ndjfl/1093891899 
  7. ^ The term was originally restricted to binary operations, but since the end of the 20th century it is used more generally. Martin, N.M. (1989), Systems of logic, Cambridge University Press, p. 54, ISBN 978-0-521-36770-7 .
  8. ^ Scharle, T.W. (1965), "Axiomatization of propositional calculus with Sheffer functors", Notre Dame J. Formal Logic, 6 (3): 209–217, doi:10.1305/ndjfl/1093958259 .
  9. ^ a b Wernick, William (1942) "Complete Sets of Logical Functions," Transactions of the American Mathematical Society 51: 117–32. In his list on the last page of the article, Wernick does not distinguish between ← and →, or between and .
  10. ^ "NAND Gate Operations" at
  11. ^ "NOR Gate Operations" at