Difference between revisions of "De Morgan's Law"
(→The Process) |
(→How to apply) |
||
| Line 11: | Line 11: | ||
==How to apply== | ==How to apply== | ||
| + | ===Example 1=== | ||
| + | |||
| + | <math> (¯(¯(A+B))+B) </math> | ||
| + | |||
| + | ===Example 2=== | ||
| + | |||
| + | ===Example 3=== | ||
| + | |||
| + | ===Example 4=== | ||
Revision as of 12:39, 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...
The Process
Step 1 - Reverse the sign
Step 2 - Negate each term
Step 3 - Negate the whole expression
How to apply
Example 1
