Boolean Algebra §
- De Morgan’s Laws
- States that:
- One way to remember De Morgan is to change everything about the state of the expression (the order is not important)
- Logical connectives must be changed (AND to OR, OR to AND)
- Each input’s (variable’s) state must be changed (Ā to A, A to Ā)
- The whole expression’s state must be changed
- De Morgan’s Laws allow us to construct logic circuits using only NAND or NOR gates.
- De Morgan’s Law works across n inputs
- With multiple terms, you can perform De Morgan’s Law only to specific terms if you wish
- g.
