The pair of logical equivalences that relate negation with conjunction and disjunction: ¬(A ∧ B) is equivalent to (¬A) ∨ (¬B), and ¬(A ∨ B) is equivalent to (¬A) ∧ (¬B) in classical logic and Boolean algebra.

Principle

Negation distributes over conjunction and disjunction by dualizing them: the negation of a conjunction is the disjunction of the negations, and vice versa.

Demonstration

In set-theoretic terms, the complement of the intersection of two sets equals the union of their complements: (A ∩ B)^c = A^c ∪ B^c, which is a direct instance of De Morgan's laws.

Misapplication

Blindly applying De Morgan transformations in systems with non-classical negation, in modal contexts without scope care, or in intuitionistic logic where the biconditionals may fail is a misuse that yields invalid equivalences.

Consequence

Facilitates simplification and normalization of logical formulas, enables algorithmic transformations in Boolean algebra and digital logic, and makes explicit the duality between ∧ and ∨ under negation.

Reversal

If De Morgan equivalences are denied, negation cannot be treated as a dualizing operator and many standard simplifications and dualities in Boolean reasoning collapse; this occurs in some non-classical logics.

Boundary

Hold in classical propositional logic, Boolean algebra, and standard set theory; may fail or require modification in intuitionistic logic, certain modal logics, substructural logics, or under non-standard negations.

Semantic Tension

Tension appears with intuitionistic negation: while ¬(A ∨ B) implies (¬A) ∧ (¬B) classically, the reverse direction or the other De Morgan equivalence may not be provable intuitionistically, creating a semantic divergence.

Synthesis

De Morgan's Laws state the dual relationships by which negation converts conjunctions into disjunctions of negations and vice versa; they encode a core symmetry of classical logic that undergirds simplification and duality transformations.