- Asked 2/22
- 2082 Shrawan · 2 marks
- 2076 Chaitra · 2 marks
State and prove De Morgan's laws
Short answer
De Morgan's laws: ¬(A+B) = ¬A·¬B and ¬(A·B) = ¬A+¬B. Proof by truth table shows both sides match for all four input combinations, confirming the identities.
State and prove De-Morgan's laws.
First theorem: the complement of a sum (OR) of variables equals the product (AND) of their complements.
Second theorem: the complement of a product (AND) of variables equals the sum (OR) of their complements.
In words: "break the bar and change the sign".
Proof by truth table
| A | B | ||||
|---|---|---|---|---|---|
| 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 |
| 1 | 1 | 0 | 0 | 0 | 0 |
For all four input combinations, column 3 equals column 4 and column 5 equals column 6, so both theorems are proved.
Algebraic proof (Theorem 1): let and . Then and . A variable that ORs with X to give 1 and ANDs with X to give 0 is , so . Theorem 2 follows by duality.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- De Morgan's laws; XOR from NAND gates · Digital Logic, chapter 2
- De Morgan's laws; XOR using 3-input NAND · Digital Logic, chapter 2
- De Morgan's laws; XNOR using NOR gates · Digital Logic, chapter 2
- Prove De Morgan's theorems; XOR using NAND · Digital Logic, chapter 2 · asked 3×
- De Morgan; NOR gate from NAND gates · Digital Logic, chapter 2
- De Morgan; positive NAND equals negative NOR · Digital Logic, chapter 2
- State and prove De Morgan's theorems · Basic Electronics Engineering, chapter 6 · asked 4×
- De Morgan's theorem and duality theorem · Basic Electronics Engineering, chapter 6