if "¬" (not) and "?" (or) are already in use.

A minimal set of operators that can express every statement expressible in the propositional calculus is called a minimal functionally complete set. A minimally complete set of operators is achieved by NAND alone {?} and NOR alone {?}.

The following are the minimal functionally complete sets of operators whose arities do not exceed 2:;One element: {?}, {?}.;Two elements: , , , , , , , , , , ,

1.Previous
3.Next