- The laws can be expressed in Boolean logic as: NOT (a AND b) = NOT a OR NOT b; NOT (a OR b) = NOT a AND NOT b.
- In logic, De Morgan's laws (or De Morgan's theorem), named for nineteenth century logician and mathematician Augustus De Morgan, are two powerful rules of Boolean algebra and set theory.
- This completes the proof of the first of De Morgan's laws; the second is obtained by similar reasoning.
- In set theory, de Morgan's laws relate the three basic set operations to each other; the union, the intersection, and the complement.
Early 20th century: named after Augustus de Morgan (1806–71), English mathematician, but already known (by logicians) as principles in the Middle Ages.
For editors and proofreaders
Syllabification: de Mor·gan's laws
Definition of de Morgan's laws in:
What do you find interesting about this word or phrase?
Comments that don't adhere to our Community Guidelines may be moderated or removed.