Difference between revisions of "De Morgan's Law"
(→The Process) |
|||
Line 9: | Line 9: | ||
===Step 2 - Negate each term=== | ===Step 2 - Negate each term=== | ||
===Step 3 - Negate the whole expression=== | ===Step 3 - Negate the whole expression=== | ||
+ | |||
+ | ==How to apply== |
Revision as of 13:31, 9 May 2018
DeMorgan's laws are the laws of how a NOT gate affects AND and OR statements. They can be easily remembered by "break the line, change the sign". The following image is how to prove De Morgan's Law...