In propositional logic and boolean algebra, De Morgan's laws are a pair of transformation rules that are both valid rules of inference. The rules allow the expression of conjunctions and disjunctions purely in terms of each other via negation.
The rules can be expressed in English as:
The negation of a conjunction is the disjunction of the negations.
The negation of a disjunction is the conjunction of the negations.
The rules can be expressed in formal language with two propositions P and Q as:
where:
- ¬ is the negation operator (NOT)
- is the conjunction operator (AND)
- is the disjunction operator (OR)
- ⇔ is a metalogical symbol meaning "can be replaced in a logical proof with"
Applications of the rules include simplification of logical expressions in computer programs and digital circuit designs. De Morgan's laws are an example of a more general concept of mathematical duality.
Read more about De Morgan's Laws: Formal Notation, History, Informal Proof, Formal Proof, Extensions
Famous quotes containing the words morgan and/or laws:
“O, pluck was he to the backbone and clear grit through and through;
Boasted and bragged like a trooper; but the big words wouldn’t do;
The boy was dying, sir, dying, as plain as plain could be,
Worn out by his ride with Morgan up from the Tennessee.”
—Constance Fenimore Woolson (1840–1894)
“The chess-board is the world; the pieces are the phenomena of the universe; the rules of the game are what we call the laws of Nature. The player on the other side is hidden from us. We know that his play is always fair, just, and patient. But also we know, to our cost, that he never overlooks a mistake, or makes the smallest allowance for ignorance.”
—Thomas Henry Huxley (1825–1895)