De Morgan's Laws - Formal Proof

Formal Proof

The laws may be proven directly using truth tables; "1" represents true, "0" represents false.

First we prove: ¬(pq) ⇔ (¬p) ∧ (¬q).

p q pq ¬(pq) ¬p ¬q p) ∧ (¬q)
0 0 0 1 1 1 1
0 1 1 0 1 0 0
1 0 1 0 0 1 0
1 1 1 0 0 0 0

Since the values in the 4th and last columns are the same for all rows (which cover all possible truth value assignments to the variables), we can conclude that the two expressions are logically equivalent.

Now we prove ¬(pq) ⇔ (¬p) ∨ (¬q) by the same method:

p q pq ¬(pq) ¬p ¬q p) ∨ (¬q)
0 0 0 1 1 1 1
0 1 0 1 1 0 1
1 0 0 1 0 1 1
1 1 1 0 0 0 0

Read more about this topic:  De Morgan's Laws

Famous quotes containing the words formal and/or proof:

    The conviction that the best way to prepare children for a harsh, rapidly changing world is to introduce formal instruction at an early age is wrong. There is simply no evidence to support it, and considerable evidence against it. Starting children early academically has not worked in the past and is not working now.
    David Elkind (20th century)

    There are some persons in this world, who, unable to give better proof of being wise, take a strange delight in showing what they think they have sagaciously read in mankind by uncharitable suspicions of them.
    Herman Melville (1819–1891)