Electrical Engineering › Section S · Logic gates and Boolean algebra › Topic S.3
Boolean operations, laws, and DeMorgan's theorems
Boolean algebra is the arithmetic of logic circuits: a small set of laws and rules lets you rewrite any expression, and so any circuit, in a different but equivalent form. This topic states those laws, proves the less obvious rules, and shows how DeMorgan's theorems convert between AND and OR forms.
In this topic
- Variables, literals and terms
- The three laws
- Rules with constants and repeats
- Three rules that simplify
- Worked example: proving a rule two ways
- DeMorgan's theorems
- Applying DeMorgan step by step
- Worked example: a bar over a product
- Worked example: a bar over a sum
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…