- 2079 Bhadra · 2+4 marks
De Morgan; positive NAND equals negative NOR
Short answer
De Morgan's laws: ¬(A+B)=¬A·¬B, ¬(A·B)=¬A+¬B, proved by truth table. A positive NAND (output 0 only when both inputs 1) becomes a NOR under negative logic because complementing all signals gives output 1 only when both inputs 0, matching the NOR function.
State and prove De-Morgan's theorems with necessary diagrams and prove that positive NAND equivalent is equal to negative NOR.
De Morgan's theorems
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.
Diagrams
Theorem 1: NOR = bubbled AND
A --|‾‾‾\ A --o|‾‾‾\
| OR )o-- Y = | AND )-- Y
B --|___/ B --o|___/
Theorem 2: NAND = bubbled OR
A --|‾‾‾\ A --o|‾‾‾\
| AND )o-- Y = | OR )-- Y
B --|___/ B --o|___/
(o = inversion bubble)
Positive NAND = negative NOR
Consider a gate whose voltage table is:
| A | B | Y |
|---|---|---|
| L | L | H |
| L | H | H |
| H | L | H |
| H | H | L |
Positive logic (H = 1, L = 0):
| A | B | Y |
|---|---|---|
| 0 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
Output is 0 only when both inputs are 1: a NAND gate.
Negative logic (H = 0, L = 1), same circuit:
| A | B | Y |
|---|---|---|
| 1 | 1 | 0 |
| 1 | 0 | 0 |
| 0 | 1 | 0 |
| 0 | 0 | 1 |
Output is 1 only when both inputs are 0: a NOR gate.
Algebraically: going to negative logic complements all inputs and the output:
Hence positive-logic NAND is equivalent to negative-logic NOR.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- De Morgan; negative OR equals positive AND · 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
- Prove positive XOR equals negative XNOR · Digital Logic, chapter 2 · asked 3×
- Positive/negative logic; verify 3-variable De Morgan · Digital Logic, chapter 2
- Positive XOR equals negative XNOR · Digital Logic, chapter 2 · asked 3×
- State and prove De Morgan's theorems · Basic Electronics Engineering, chapter 6 · asked 4×
- Equal positive and negative sequence impedances · Power System Analysis II, chapter 4