MathLiveDe Morgan's laws
These two rules of propositional logic say that the negation of a conjunction equals the disjunction of the negations, and the negation of a disjunction equals the conjunction of the negations. They are used to simplify or rewrite logical expressions and negated conditions.
\neg(P \land Q) \equiv (\neg P \lor \neg Q) \quad \text{and} \quad \neg(P \lor Q) \equiv (\neg P \land \neg Q)What the symbols mean
| a propositional formula (true or false statement) | |
| a propositional formula (true or false statement) | |
| logical negation (NOT) | |
| logical conjunction (AND) | |
| logical disjunction (OR) |
About this formula
- FieldMathematics
- TopicMathematical logic
- LevelUniversity
- Also calledDe Morgan's theorem, DeMorgan's laws, negation of conjunction, negation of disjunction, logic negation distribution, NOT AND OR equivalence
- SourceWikidata Q173300
Write it in Obsidian
MathLive is a free visual math editor for Obsidian. Run Find a formula, type “de morgan's laws”, and it goes into your note as editable LaTeX. You can also scan formulas from screenshots, PDFs and handwriting.