Broschiertes Buch

Functional Completeness

Versandkostenfrei!

Versandfertig in 6-10 Tagen

23,99 €

inkl. MwSt.

Jetzt bewerten

PAYBACK Punkte

12 °P sammeln!

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. A well known complete set of connectives is { AND, OR, NOT }, consisting of binary conjunction, binary disjunction and negation. The set consisting only of the binary operator NAND is also functionally complete. In a context of propositional logic, functionally complete sets of connectives are also called (expressively) adequate.