Gates and Boolean algebraLesson 3 of 5
De Morgan: two expressions, one table
Two expressions are equal when their truth tables match on every row, which is how De Morgan’s laws are proved.
Locked
Unlock the rest of Digital Logic Design: from gates to machines that remember.
- Every lesson, every resource, unlocked instantly.
- Track progress and pick up where you left off.
- Free preview lessons stay readable from the outline.