Redirected from De Morgan's Laws
In Boolean algebra notation:
Equivalently, in set notation:
These can be proved simply: either carefully following the process of taking complements with a Venn diagram suffices or using a truth table like this:
p q  not(p or q)  not(p) and not(q) ++ T T  F  F T F  F  F F T  F  F F F  T  T p q  not(p and q)  not(p) or not(q) ++ T T  F  F T F  T  T F T  T  T F F  T  T
This simple fact is used extensively in digital circuit design for manipulating the types of logic gates used by the circuit.
Charles Peirce showed that this result appled to logical and for intersect, logical or for union, and logical negation for complement.
Search Encyclopedia

Featured Article
