De Morgan's laws describe how negation changes a statement involving AND or OR. They are useful whenever a logical condition needs to be rewritten without changing its meaning.
¬(A∧B)≡(¬A)∨(¬B)
In words: not both A and B means not A or not B. The OR here is inclusive: it is true if one or both of its statements are true.
All flashcards
Logical equivalence
Expressions related by ↔ have the same truth value in every case and can replace one another.
Set complement
Relative to a fixed universe U,A contains the elements of U that are not in A.
De Morgan duality
Negation interchanges paired operations, such as AND with OR and intersection with union.
Negation normal form
A form in which negations occur only directly on basic propositions.
Classical and intuitionistic logic
The equivalence ¬(P∧Q)↔(¬P∨¬Q) holds classically, but not generally intuitionistically.
Quiz questions
In logic, what does X⊢Y mean?Answer: Y follows from X.
For sets A and B, which expression is equivalent to the set difference A−B?Answer: A∩B
Which expression is equivalent to the modal formula ◊p?Answer: ¬□¬p
What does the symbol ↔ express between two logical formulas?Answer: They have the same truth value in every case.
In classical logic, which formula expresses that every object has property P?Answer: ¬∃x¬P(x)
Based on the Wikipedia article De Morgan's laws, licensed CC BY-SA 4.0. Adapted into a summary, flashcards and quizzes.