Discrete mathematicsLesson 2 of 2 in the course Boolean algebra and logic gates

De Morgan's Laws in Logic, Set Theory, and Boolean Algebra

5 flashcards · 5 quiz questions · 5 match pairs · 5 fill-in sentences · English

Lesson progress
0 / 5

Your progress is kept in this browser only.Sign up to save it

Summary

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)\neg(A \land B) \equiv (\neg A) \lor (\neg 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 ↔\leftrightarrow have the same truth value in every case and can replace one another.
Set complement
Relative to a fixed universe UU, A‾\overline{A} contains the elements of UU that are not in AA.
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)\neg(P \land Q) \leftrightarrow (\neg P \lor \neg Q) holds classically, but not generally intuitionistically.

Quiz questions

  1. In logic, what does X⊢YX \vdash Y mean?Answer: YY follows from XX.
  2. For sets AA and BB, which expression is equivalent to the set difference A−BA - B?Answer: A∩B‾A \cap \overline{B}
  3. Which expression is equivalent to the modal formula ◊p\Diamond p?Answer: ¬□¬p\neg\Box\neg p
  4. What does the symbol ↔\leftrightarrow express between two logical formulas?Answer: They have the same truth value in every case.
  5. In classical logic, which formula expresses that every object has property PP?Answer: ¬∃x ¬P(x)\neg\exists x\,\neg P(x)

Based on the Wikipedia article De Morgan's laws, licensed CC BY-SA 4.0. Adapted into a summary, flashcards and quizzes.

All Discrete mathematics lessons