thomasabishop/eolas
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Autosave: 2022-12-23 14:00:05

Browse source
This commit is contained in:
thomasabishop 2022-12-23 14:00:05 +00:00
parent 772109d084
commit dad4dbd366
1 changed files with 9 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
Logic/Laws_and_theorems.md/DeMorgan's_Laws.md
View file

@ -6,26 +6,31 @@ tags: [logic, laws]
# DeMorgan's Laws
DeMorgan's laws express some fundamental equivalences that obtain between the Boolean [connectives](Truth-functional%20connectives.md):
DeMorgan's laws express some fundamental equivalences that obtain between the Boolean [connectives](/Logic/Propositional_logic/Truth-functional_connectives.md).
## First Law
> The negation of a conjunction is logically equivalent to the disjunction of the negations of the original conjuncts.
$$
\sim (P \& Q) \equiv \sim P \lor \sim Q
\lnot (P \land Q) \leftrightarrow \lnot P \lor \lnot Q
$$
The equivalence is demonstrated with the following truth-table
![demorgan-1.png](/img/demorgan-1.png)
| $P$ | $Q$ | $ \lnot (P \land Q)$ | $ \lnot P \lor \lnot Q$ |
| --- | --- | -------------------- | ----------------------- |
| T | T | F | F |
| T | F | T | T |
| F | T | T | T |
| F | F | T | T |
## Second Law
> The negation of a disjunction is equivalent to the conjunction of the negation of the original disjuncts.
$$
\sim (P \lor Q) \equiv \sim P \& \sim Q
\lnot (P \lor Q) \leftrightarrow \lnot P \land \lnot Q
$$
![demorgan-2.png](/img/demorgan-2.png)