Which of the following best describes what it means for a set of Boolean operators to be functionally complete ?

Question

Which of the following best describes what it means for a set of Boolean operators to be  functionally complete ?

Answer

The set can be used to define every possible Boolean function using expressions built only from those operators.

Answer

The concept of functional completeness is not defined for boolean operators.

Answer

The set includes all the basic Boolean operations: AND, OR, NOT, XOR.

Answer

The set allows the construction of a truth table for any Boolean expression.

Answer

The set can simplify any Boolean expression into a shorter equivalent form.

Crowdly