De Morgan's laws
Negation distributes, flips operators
De Morgan's laws are two rules in logic and set theory showing how negation distributes over conjunctions and disjunctions.
In plain terms: "not (A and B)" equals "not A or not B," and "not (A or B)" equals "not A and not B." These equivalences are fundamental in Boolean algebra, computer programming, and circuit design, allowing complex logical expressions to be simplified or rewritten in alternative forms.
Denial or cancellation
- conjunctionWord joining clauses together
- disjunctionState of being apart
- logical connectivesSymbols joining logical statements
- truth tablesCharts mapping logical outcomes
contrapositive · implication · tautology · quantifiers · syntax · semantics · validity
What makes complete
- intersectionPoint where paths meet
- unionJoining into one
- Venn diagramSet intersection illustration
- subsetCollection within collection
empty set · elements · membership · disjoint · cardinality
Invariance under transformation
- transformationThorough change in form
- equivalenceState of being equal
- interchangeabilityQuality of being swappable
negation
Denial or cancellation
- conjunctionWord joining clauses together
- disjunctionState of being apart
- logical connectivesSymbols joining logical statements
truth tables · contrapositive · implication · tautology · quantifiers · syntax · semantics · validity
complement
What makes complete
- intersectionPoint where paths meet
- unionJoining into one
- Venn diagramSet intersection illustration
subset · empty set · elements · membership · disjoint · cardinality
symmetry
Invariance under transformation
- transformationThorough change in form
- equivalenceState of being equal
- interchangeabilityQuality of being swappable
- Boolean logicand, or, not, true, false
- logic rulessyllogism, inference, contraposition, double negation, conjunction
- logicpremise, premises, conclusion, conclusions, inference