What is De Morgan’s Law
De Morgan’s law is the law that gives the relation between union, intersection, and complements in set theory. In Boolean algebra, it gives the relation between AND, OR, and complements of the variable, and in logic, it gives the relation between AND, OR, or Negation of the statement. With the help of De Morgan’s Law, we can optimize various boolean circuits involving logic gates which help us perform the same operation but with very few apparatus.
De Morgan’s Law – Theorem, Proofs, Formula & Examples
De Morgan’s law is the most common law in set theory and Boolean algebra as well as set theory. In this article, we will learn about De Morgan’s law, De Morgan’s law in set theory, and De Morgan’s law in Boolean algebra along with its proofs, truth tables, and logic gate diagrams. The article also includes the solved De Morgan’s Law Example and FAQs on De Morgan’s law. Let us learn about De Morgan’s law.
Table of Content
- What is De Morgan’s Law
- De Morgan’s Law in Set Theory
- First De Morgan’s Law
- Second De Morgan’s Law
- Proof Using Algebra of Sets
- De Morgan’s Law in Boolean Algebra
- De Morgan’s Law Formula
- Solved Examples on De Morgan’s Law
- Logic Applications of De Morgan’s Law