Two algebraic rules that describe how complementation (logical negation or set complement) distributes over the binary operations of union and intersection (or OR and AND): the complement of a union equals the intersection of the complements, and the complement of an intersection equals the union of the complements.

Principle

Negation or complementation reverses the order of binary connective operations: complement(x ∪ y) = complement(x) ∩ complement(y) and complement(x ∩ y) = complement(x) ∪ complement(y); the same structural swap applies in Boolean algebras and propositional logic between OR and AND under negation.

Demonstration

In set theory, if A = {1,2} and B = {2,3} inside universe U = {1,2,3,4}, then (A ∪ B)^c = {4} while A^c ∩ B^c = {4}; in propositional logic, ¬(P ∨ Q) is equivalent to (¬P ∧ ¬Q), so a truth table for P and Q shows the rows where ¬(P ∨ Q) and (¬P ∧ ¬Q) match.

Misapplication

Applying the laws without valid complements (for example in structures lacking a well-defined complement), or failing to swap the operations (writing complement(x ∪ y) = complement(x) ∪ complement(y)), or treating implication or quantifiers the same way without conversion to appropriate normal forms.

Consequence

They permit systematic rewriting of complements into forms that may simplify proofs, circuit designs, or algebraic manipulations; they also underlie normal-form conversions and minimization techniques in Boolean algebra and digital logic.

Reversal

The inverted idea would be trying to distribute complement while preserving the same binary operation (e.g., claiming complement(x ∪ y) = complement(x) ∪ complement(y)); that reversal breaks equivalence and typically produces a different, incorrect expression.

Boundary

Valid in Boolean algebras, power-set algebras, and classical propositional logic; may fail or require modification in non-classical logics (intuitionistic, some paraconsistent logics) and in algebraic structures without complements or with nonclassical negations (fuzzy, multivalued algebras).

Semantic Tension

Tension arises between treating De Morgan's Laws as purely syntactic rewrite rules used in symbol manipulation and as semantic equivalences reflecting truth-conditions; another tension is between classical negation, where the laws hold exactly, and weakened negations that alter one or both directions.

Synthesis

De Morgan's Laws unify complement and binary operations by asserting that complementation converts unions to intersections and vice versa; they are simple algebraic equivalences with broad use in set theory, Boolean algebra, and propositional logic for rewriting and simplifying expressions.