Semiconductor & Computer Engineering
From WikiChip
Difference between revisions of "boolean algebra/functional completeness"
m (David moved page functional completeness to boolean algebra/functional completeness) |
|||
| Line 1: | Line 1: | ||
| + | {{ba title|functional completeness}} | ||
{| class="wikitable" style="float: right;" | {| class="wikitable" style="float: right;" | ||
! colspan="6" | Logic function classification | ! colspan="6" | Logic function classification | ||
Revision as of 23:04, 7 December 2015
| Logic function classification | |||||
|---|---|---|---|---|---|
| Func | Monotone Inc | Self-dual | Linear | 0-preserving | 1-preserving |
| LOW | ✔ | ✘ | ✔ | ✔ | ✘ |
| HIGH | ✔ | ✘ | ✔ | ✘ | ✔ |
| NOT | ✘ | ✔ | ✔ | ✘ | ✘ |
| AND | ✔ | ✘ | ✘ | ✔ | ✔ |
| OR | ✔ | ✘ | ✘ | ✔ | ✔ |
| XOR | ✘ | ✘ | ✔ | ✔ | ✘ |
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 }. Such sets are also called complete sets.
Examples
The following are some examples of functionally complete sets:
Determining Completeness
- Given a set of Boolean functions
- Find at least one of each:
- Identify functional completeness.
From the table it can be seen that the following sets are functionally complete: { AND, NOT }, { OR, NOT }, { AND, OR, NOT }.