## FANDOM

1,180 Pages

De Morgan's laws are a pair of simple statements relating disjunction and conjunction in formal logic. Specifically:

1. The negation of the conjunction of two statements is logically equivalent to the disjunction of their negations.
2. The negation of the disjunction of two statements is logically equivalent to the conjunction of their negations.

Since the English description is obviously very unwieldy, they are better described here in terms of logical operators, respectively:

1. $\neg(p\and q)\equiv\neg p\or\neg q$
2. $\neg(p\or q)\equiv\neg p\and\neg q$

Both of these laws can easily be verified using truth tables:

$p$ $q$ $\neg(p\and q)$ $\neg p\or\neg q$
T T F F
T F T T
F T T T
F F T T
$p$ $q$ $\neg(p\or q)$ $\neg p\and\neg q$
T T F F
T F F F
F T F F
F F T T

## Application of De Morgan's Laws

Even though De Morgan's laws seem useless at the outset, they are really an important part of the logician's toolbox. Here is an example of a short formal logical proof which relies strongly on DeMorgan's surprisingly important discovery:

1. $(A\or B)\to(C\and D)$
2. $\neg C/\therefore\neg B$
3. $\neg C\or\neg D$ (2, Add.)
4. $\neg(C\and D)$ (3, De M.)
5. $\neg(A\or B)$ (1,4, M.T.)
6. $\neg A\and\neg B$ (5, De M.)
7. $\neg B\and\neg A$ (6, Com.)
8. $\neg B$ (7, Simp.)

De Morgan's first law is used twice in this proof. ('De Morgan' is conventionally shortened to 'De M.' in logical proofs.) In the first instance, the premiss $\neg C$ is used to form the disjunctive statement $\neg C\or\neg D$—perfectly legal in formal logic—and then transformed into its conjunctive form with the first law. This form easily demonstrates the negation of $A\or B$ through the principle of modus tollens, and since $\neg (A\or B)$ is also a candidate for transformation through De Morgan's first law, it becomes $\neg A\and\neg B$ . $\neg B$ then follows trivially from this statement. De Morgan's laws are a powerful tool for simplifying proofs greatly, not only for humans, but for automated theorem provers as well.

Community content is available under CC-BY-SA unless otherwise noted.