Jump to content

De Morgan's laws

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Jeronimo (talk | contribs) at 03:49, 26 July 2002 (moved from DeMorgans Law). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

DeMorgan's Law, named for nineteenth century logician and mathematician Augustus DeMorgan, is a powerful rule of Boolean algebra and Set Theory. It can be expressed as a pair of equations:

P and Q = not((not P) or (not Q))
P or Q = not((not P) and (not Q))

Equivalently, in set notation:

A ∩ B = ( A' ∪ B')'
A ∪ B = ( A' ∩ B')'

These can be proved simply: carefully following the process of taking complements with a Venn diagram suffices.

This simple fact is used extensively in digital circuit design for manipulating the types of logic gates used by the circuit.