De Morgan’s laws describe how negation distributes over AND and OR operations.
What Is De Morgan’s Laws?
De Morgan’s laws describe how negation distributes over AND and OR operations.
Examples of De Morgan’s Laws
1
NOT(A AND B) = NOT A OR NOT B.Formula and Key Points
Formula / rule
¬(p∧q)=¬p∨¬q; ¬(p∨q)=¬p∧¬q
- Know the definition and standard notation for De Morgan's Laws.
- Be able to recognise or compute de morgan's laws in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in program conditions, digital circuits, database queries, formal verification, search and decision logic.
Related Math Terms
De Morgan’s Laws: Frequently Asked Questions
What is De Morgan's Laws?
De Morgan’s laws describe how negation distributes over AND and OR operations.
Why is De Morgan's Laws useful in computer science?
Used in program conditions, digital circuits, database queries, formal verification, search and decision logic.