De Morgan's laws
In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathematician. The rules allow the expression of conjunctions and disjunctions purely in terms of each other via negation.
De Morgan's laws - Wikipedia Jump to content From Wikipedia, the free encyclopedia Pair of logical equivalences This article may contain original research . Please improve it by verifying the claims made and adding inline citations . Statements consisting only of original research should be removed. ( September 2025 ) ( Learn how and when to remove this message ) De Morgan's laws represented with Venn diagrams . In each case, the resultant set is the set of all points in any shade of blue. Transformation rules Propositional calculus Rules of inference ( List ) Implication introduction / elimin
Explore this link on the map →related reading
- Intuitionistic logic - Wikipediaen.wikipedia.org
- First-order logic - Wikipediaen.wikipedia.org
- List of logic symbols - Wikipediaen.wikipedia.org
- Logic as algebraspencermortensen.com
- Using Bollean Algebra in circuitscs.virginia.edu
- Quantifier (logic) - Wikipediaen.wikipedia.org
- 3. Logic - Mathematics in Lean v4.19.0 documentationleanprover-community.github.io
- Modus tollens - Wikipediaen.wikipedia.org
- Douglas W. Jones on Ternary Logichomepage.cs.uiowa.edu
- Law of excluded middle - Wikipediaen.wikipedia.org
- T-norm fuzzy logics - Wikipediaen.wikipedia.org
- Modus ponens - Wikipediaen.wikipedia.org