In this video I explain, with examples, how De Morgan's theorem (or De Morgan's rules, or De Morgan's laws) can be applied using Boolean algebra.

Break the line, change the sign!

This can be applied to combinations of logic gates in order to make a logic system entirely from NAND gates (see my NAND realisation video), or NOR gates (see my NOR realisation video). It can also be applied to help simplify a system.

My Electronics channel:
[ Ссылка ]
Related videos:
Logic gates: [ Ссылка ]
Boolean and truth tables: [ Ссылка ]
Boolean and logic gates: [ Ссылка ]
Redundancy theorem: [ Ссылка ]
Race Hazard theorem: [ Ссылка ]
NAND realisation: [ Ссылка ]

свернуть