A set of logic operations is functionally complete in Boolean algebra provided every propositional function can be expressed entirely in terms of operations in the set - i.e. by combining the various logic operations in a set one could create every truth table. Two notable sets are { NAND } and { NOR }.

Examples

The following are some examples of functionally complete sets:

• { NOR }, { NAND }, { MIN }, { INH }, { MUX }
• { AND, NOT }, { OR, NOT }, { XOR, AND }, { MAJ, NOT }

This article is still a stub and needs your attention. You can help improve this article by editing this page and adding the missing information.