Logic/De Morgan's laws
From Internet Web School
Revision as of UNIQ7db373257bc6c07f-MathJax-2-QINU2
Logic > De Morgan's laws
Contents |
Contents
Overview
Definition of De Morgan's laws by truth table
0 means false, 1 means true, and ≡ means equivalent.
Case of "￢(P∧Q)" ≡ "￢P∨￢Q".
| P | Q | P∧Q | ￢P | ￢Q | ￢P∨￢Q | ￢（P∧Q） |
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 0 | 0 | 0 | 0 |
Case of "￢(P∨Q)" ≡ "￢P∧￢Q".
| P | Q | P∨Q | ￢P | ￢Q | ￢P∧￢Q | ￢（P∨Q） |
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 | 0 |
