De Morgan's Law Calculator

Proposition A:

Select the truth value for Proposition A.

Please select a value for Proposition A.

Proposition B:

Select the truth value for Proposition B.

Please select a value for Proposition B.

Calculation Results

Law 1: NOT (A AND B) = (NOT A) OR (NOT B)
=

Law 2: NOT (A OR B) = (NOT A) AND (NOT B)
=

A AND B:

NOT A:

NOT B:

A OR B:

The values displayed are logical states (True/False). De Morgan's Laws demonstrate fundamental equivalences in Boolean algebra, proving that negating a conjunction is equivalent to the disjunction of the negations, and vice versa.

Truth Table for De Morgan's Laws

This truth table systematically shows all possible combinations of truth values for Propositions A and B, and how De Morgan's Laws hold true in every scenario. Observe how the columns for `NOT (A AND B)` and `(NOT A) OR (NOT B)` are identical, as are `NOT (A OR B)` and `(NOT A) AND (NOT B)`.

Comprehensive Truth Table Demonstrating De Morgan's Laws
A	B	NOT A	NOT B	A AND B	NOT (A AND B)	(NOT A) OR (NOT B)	A OR B	NOT (A OR B)	(NOT A) AND (NOT B)

Visual Representation of De Morgan's Law

This chart visually compares the truth values of the left-hand side (LHS) and right-hand side (RHS) of De Morgan's Laws for your selected propositions, illustrating their equivalence. Green indicates True, Red indicates False.

What is De Morgan's Law?

**De Morgan's Law** is a set of two fundamental rules in Boolean algebra and propositional logic that describe how negation interacts with logical conjunction (AND) and disjunction (OR). Named after the British mathematician Augustus De Morgan, these laws provide a way to transform logical expressions, simplifying them or making them easier to understand. They are crucial for simplifying complex logical statements, designing digital circuits, and optimizing database queries.

The two laws are:

The negation of a conjunction is the disjunction of the negations. In symbols: NOT (A AND B) is equivalent to (NOT A) OR (NOT B).
The negation of a disjunction is the conjunction of the negations. In symbols: NOT (A OR B) is equivalent to (NOT A) AND (NOT B).

Who Should Use This De Morgan's Law Calculator?

This **De Morgan's Law Calculator** is ideal for:

Students studying logic, discrete mathematics, computer science, or electrical engineering.
Programmers looking to simplify conditional statements or understand complex boolean expressions.
Database Administrators optimizing SQL queries that involve complex logical conditions.
Digital Circuit Designers simplifying logic gates and circuits.
Anyone interested in understanding the foundational principles of Boolean algebra and propositional logic.

Common Misunderstandings about De Morgan's Law

A common mistake is incorrectly applying the negation or forgetting to flip the operator (AND to OR, or OR to AND). For instance, people might mistakenly think that NOT (A AND B) is equivalent to (NOT A) AND (NOT B), which is incorrect. The laws explicitly require the operator to change. Also, some might confuse the application in set theory (union/intersection) with logical propositions, though the principles are analogous. The values here are logical states (True/False), not physical units.

De Morgan's Law Formula and Explanation

De Morgan's Laws are expressed using logical operators:

AND (conjunction): True if both operands are True.
OR (disjunction): True if at least one operand is True.
NOT (negation): Flips the truth value of an operand (True becomes False, False becomes True).

Law 1: The Negation of a Conjunction

Formula: NOT (A AND B) ≡ (NOT A) OR (NOT B)

This law states that if it's not the case that both A and B are true, then either A is false, or B is false (or both are false).

Law 2: The Negation of a Disjunction

Formula: NOT (A OR B) ≡ (NOT A) AND (NOT B)

This law states that if it's not the case that A or B is true, then both A must be false AND B must be false.

Variables Used in De Morgan's Law Calculations
Variable	Meaning	Unit / Type	Typical Range
A	Proposition A	Logical State	True, False
B	Proposition B	Logical State	True, False
NOT A	Negation of Proposition A	Logical State	True, False
NOT B	Negation of Proposition B	Logical State	True, False
A AND B	Conjunction of A and B	Logical State	True, False
A OR B	Disjunction of A and B	Logical State	True, False

Practical Examples of De Morgan's Law

De Morgan's Laws are not just theoretical; they have real-world applications in various fields.

Example 1: Conditional Logic in Programming

Imagine you have a program where a certain action should *not* happen if both `userIsAdmin` AND `featureIsDisabled` are true.

Initial Condition: if (!(userIsAdmin && featureIsDisabled)) { /* proceed with action */ }
Applying De Morgan's Law (Law 1): This is equivalent to if (!userIsAdmin || !featureIsDisabled) { /* proceed with action */ }

Inputs: Let's say `userIsAdmin` (Proposition A) is True, and `featureIsDisabled` (Proposition B) is False.
Units: Logical states (True/False).
Results:

A (userIsAdmin) = True
B (featureIsDisabled) = False
A AND B (userIsAdmin && featureIsDisabled) = False
NOT (A AND B) = True
NOT A (!userIsAdmin) = False
NOT B (!featureIsDisabled) = True
(NOT A) OR (NOT B) = (False OR True) = True

Both sides of the equation evaluate to True, confirming the law. The action would proceed.

Example 2: Database Query Optimization

Consider a database query where you want to select records that are *not* both 'active' AND 'priority'.

Initial Query Condition: WHERE NOT (status = 'active' AND type = 'priority')
Applying De Morgan's Law (Law 1): This can be rewritten as WHERE status != 'active' OR type != 'priority'

The second form can sometimes be more efficient for the database engine to process, especially with certain indexing strategies.

Inputs: Let's say `status = 'active'` (Proposition A) is True, and `type = 'priority'` (Proposition B) is True.
Units: Logical states (True/False).
Results:

A (status = 'active') = True
B (type = 'priority') = True
A AND B = True
NOT (A AND B) = False
NOT A = False
NOT B = False
(NOT A) OR (NOT B) = (False OR False) = False

Both sides evaluate to False, meaning records that are both active and priority would be excluded.

How to Use This De Morgan's Law Calculator

Using the **De Morgan's Law Calculator** is straightforward:

Select Proposition A: Choose either "True" or "False" from the dropdown menu for Proposition A. This represents the truth value of your first logical statement.
Select Proposition B: Similarly, choose "True" or "False" from the dropdown menu for Proposition B, representing your second logical statement.
View Results: As soon as you make your selections, the calculator will instantly update the "Calculation Results" section.
Interpret Results:
- The primary results show the equivalence for both De Morgan's Laws. You'll see the truth value for the left-hand side (LHS) and the right-hand side (RHS), confirming they are always equal.
- Intermediate values like "A AND B", "NOT A", "NOT B", and "A OR B" are displayed to help you follow the logic step-by-step.
Unit Interpretation: The values here are logical states (True/False) and are therefore unitless. The calculator explicitly states this to avoid confusion with physical units.
Reset: Click the "Reset" button to return both propositions to their default "True" values.
Copy Results: Use the "Copy Results" button to quickly grab all calculated values and their explanations for documentation or sharing.

Below the calculator, you can also explore a comprehensive truth table and a dynamic visual representation that further illustrate how De Morgan's Laws hold for all possible input combinations.

Key Factors That Affect De Morgan's Law

While De Morgan's Laws are fundamental equivalences, understanding the factors that influence their application and interpretation is important:

Truth Values of Propositions (A and B): The most direct factor. The truth values of A and B determine the outcome of all intermediate and final logical expressions. The laws hold true for every combination of True/False for A and B.
Logical Operators Used: The laws specifically address the interaction of negation with AND and OR. They do not apply directly to other operators like XOR (exclusive OR) or implication without first converting them.
Order of Operations (Precedence): Parentheses are critical. NOT (A AND B) is different from NOT A AND B. De Morgan's Laws require the negation to apply to the entire parenthesized expression.
Application Domain: While the core logic is universal, the "meaning" of A and B changes depending on context (e.g., programming conditions, set theory, digital circuits). This contextual understanding is key to applying the laws correctly.
Clarity of Negation: Ensuring that "NOT" is correctly understood as the logical inverse of a statement is crucial. A common error is misinterpreting what "not" applies to.
Equivalence vs. Equality: De Morgan's Laws establish logical equivalence (≡), meaning the expressions always have the same truth value under the same conditions. This is not strict mathematical equality in the numerical sense but equality in terms of truth values.

Frequently Asked Questions (FAQ) about De Morgan's Law

Q: What are the two De Morgan's Laws?

A: The two laws are: 1) NOT (A AND B) ≡ (NOT A) OR (NOT B), and 2) NOT (A OR B) ≡ (NOT A) AND (NOT B). They show how to distribute negation over conjunctions (AND) and disjunctions (OR).

Q: Are De Morgan's Laws only for Boolean algebra?

A: While fundamental to Boolean algebra and propositional logic, De Morgan's Laws also have direct analogues in set theory. For sets, the complement of the union of two sets is the intersection of their complements, and the complement of the intersection is the union of their complements.

Q: Why is understanding De Morgan's Law important for programmers?

A: Programmers often deal with complex conditional statements. De Morgan's Laws help simplify these conditions, making code more readable, efficient, and less prone to errors. For example, replacing !(x > 5 && y < 10) with x <= 5 || y >= 10.

Q: How do units apply to De Morgan's Law?

A: De Morgan's Law deals with logical propositions, which have truth values (True or False). These are fundamentally unitless. There are no physical or measurable units like meters, seconds, or dollars associated with logical states.

Q: Can I use De Morgan's Law with more than two propositions?

A: Yes, De Morgan's Laws can be extended. For example, NOT (A AND B AND C) is equivalent to (NOT A) OR (NOT B) OR (NOT C). The principle remains the same: negate each component and flip the operator.

Q: What are some common errors when applying De Morgan's Law?

A: The most common errors are: 1) Forgetting to change the operator (AND to OR, or OR to AND), and 2) Incorrectly applying the negation to only part of the expression instead of the entire parenthesized group.

Q: How does this De Morgan's Law Calculator handle edge cases?

A: The calculator covers all four possible truth value combinations for two propositions (A and B). Since the inputs are constrained to "True" or "False", there are no other "edge cases" in terms of input values. The laws hold universally for these logical states.

Q: What is the relationship between De Morgan's Law and truth tables?

A: Truth tables are the primary method to formally prove De Morgan's Laws. By listing all possible truth value combinations for A and B, and then evaluating both sides of each law, a truth table demonstrates that the truth values for both sides are always identical, thus proving their equivalence. Our calculator dynamically generates a truth table to illustrate this.