2.6: De Morgan’s Laws
After completing this section, you should be able to:
- Use De Morgan’s Laws to negate conjunctions and disjunctions.
- Construct the negation of a conditional statement.
- Use truth tables to evaluate De Morgan’s Laws.
The contributions to logic made by Augustus De Morgan and George Boole during the 19th century acted as a bridge to the development of computers, which may be the greatest invention of the 20th century. Boolean logic is the basis for computer science and digital electronics, and without it the technological revolution of the late 20th and early 21st centuries—including the creation of computer chips, microprocessors, and the Internet—would not have been possible. Every modern computer language uses Boolean logic statements, which are translated into commands understood by the underlying electronic circuits enabling computers to operate. But how did this logic get its name?
George Boole was born in Lincolnshire, England in 1815. He was the son of a cobbler who provided him some initial education, but Boole was mostly self-taught. He began teaching at 16 years of age, and opened his own school at the age of 20. In 1849, at the age of 34, he was appointed Professor of Mathematics at Queens College in Cork, Ireland. In 1853, he published the paper, An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probabilities , which is the treatise that the field of Boolean algebra and digital circuitry was built on.
Reference: Posamentier, Alfred and Spreitzer Christian, “Chapter 35 George Boole: English (1815-1864)” pp. 279-283, Math Makers: The Lives and Works of 50 Famous Mathematicians , Prometheus Books, 2019.
Negation of Conjunctions and Disjunctions
In Chapter 1, Example 1.37 used a Venn diagram to prove De Morgan’s Law for set complement over union. Because the complement of a set is analogous to negation and union is analogous to an or statement, there are equivalent versions of De Morgan’s Laws for logic.
De Morgan’s Law for negation of a conjunction:
De Morgan’s Law for the negation of a disjunction:
Negation of a conditional:
Writing conditional as a disjunction:
Recall that the symbol for logical equivalence is:
De Morgan’s Laws allow us to write the negation of conjunctions and disjunctions without using the phrase, “It is not the case that …” to indicate the parentheses. Avoiding this phrase often results in a written or verbal statement that is clearer or easier to understand.
Write the negation of each statement in words without using the phrase, “It is not the case that.”
- Kristin is a biomedical engineer and Thomas is a chemical engineer.
- A person had cake or they had ice cream.
- Answer
-
1. Kristin is a biomedical engineer and Thomas is a chemical engineer has the form " \(p \wedge q\)," where \(p\) is the statement, "Kristin is a biomedical engineer," and \(q\) is the statement, "Thomas is a chemical engineer." By De Morgan's Law, the negation of a conjunction, \(\sim(p \wedge q)\), is logically equivalent to \(\sim p \vee \sim q . \sim p\) is "Kristen is not a biomedical engineer," and \(\sim q\) is "Thomas is not a chemical engineer." By De Morgan's Law, the solution has the form " \(\sim p \vee \sim q\)," so the answer is: "Kristin is not a biomedical engineer or Tom is not a chemical engineer."
2. A person had cake or they had ice cream has the form " \(p \vee q\)," where \(p\) is the statement, "A person had cake," and \(q\) is the statement, "A person had ice cream." By De Morgan's Law for the negations of a disjunction, \(\sim(p \vee q) \equiv \sim p \wedge \sim q\). The solution is the statement: "A person did not have cake and they did not have ice cream."
is not a chemical engineer.”
Negation of a Conditional Statement
The negation of any statement has the opposite truth values of the original statement. The negation of a conditional , , is the conjunction of and not , Consider the truth table below for the negation of the conditional.
| T | T | T | F |
| T | F | F | T |
| F | T | T | F |
| F | F | T | F |
The only time the negation of the conditional statement is true is when is true, and is false. This means that is logically equivalent to as the following truth table demonstrates.
| T | T | T | F | F | F | T |
| T | F | F | T | T | T | T |
| F | T | T | F | F | F | T |
| F | F | T | F | T | F | T |
Write the negation of each conditional statement.
- If Adele won a Grammy, then she is a singer.
- If Henrik Lundqvist played professional hockey, then he did not win the Stanley Cup.
- Answer
-
1. The negation of the conditional statement, \(p \rightarrow q\), is the statement, \(p \wedge \sim q\). The hypothesis of the conditional statement is \(p\) : "Adele won a Grammy," and conclusion of the conditional statement is \(q\) : "Adele is a singer." The negation of the conclusion, \(\sim q\), is the statement: "She is not a singer." Therefore, the answer is \(p \wedge \sim q\) : "Adele won a Grammy, and she is not a singer."
2. The hypothesis is \(p\) : "Henrik Lundqvist played professional hockey," and the conclusion of the conditional statement is \(q\) : "He did not win the Stanley Cup." The negation of \(q\) is the statement: "He won the Stanley Cup." The negation of the conditional statement is equal to \(p \wedge \sim q\) : "Henrick Lundqvist played professional hockey, and he won the Stanley Cup."
Write the negation of each conditional statement.
- If all cats purr, then my partner’s cat purrs.
- If a penguin is a bird, then some birds do not fly.
- Answer
-
1. The negation of the conditional statement \(p \rightarrow q\) is the statement \(p \wedge \sim q\). The hypothesis of the conditional statement is \(p\) : "All cats purr," and the conclusion of the conditional statement is \(q\) : "My partner's cat purrs." The negation of the conclusion, \(\sim q\), is the statement: "My partner's cat does not purr." Therefore, the answer is \(p \wedge \sim q\) : "All cats purr, but my partner's cat does not purr."
2. The hypothesis is \(p\) : "A penguin is a bird," and the conclusion of the conditional statement is \(q\) : "Some birds do not fly." The negation of \(q\) is the statement: "All birds fly." Therefore, the negation of the conditional statement is equal to \(p \wedge \sim q\) : "A penguin is a bird, and all birds fly."
Many of the properties that hold true for number systems and sets also hold true for logical statements. The following table summarizes some of the most useful properties for analyzing and constructing logical arguments. These properties can be verified using a truth table.
| Property | Conjunction (AND) | Disjunction (OR) |
|---|---|---|
| Commutative | ||
| Associative | ||
| Distributive | ||
| De Morgan’s | ||
| Conditional |
Negating a Conditional Statement with a Conjunction or Disjunction
Write the negation of each conditional statement applying De Morgan’s Law.
- If mom needs to buy chips, then Mike had friends over and Bob was hungry.
- If Juan had pizza or Chris had wings, then dad watched the game.
- Answer
-
1. The conditional has the form "If \(p\) then \(q\) or \(r\)," where \(p\) is "Mom needs to buy chips," \(q\) is "Mike had friends over," and \(r\) is "Bob was hungry." The negation of \(p \rightarrow(q \wedge r)\) is \(p \wedge \sim(q \wedge r)\). Applying De Morgan's Law to the statement \(\sim(q \wedge r)\) the result is \(\sim q \vee \sim r\), so our conditional statement becomes \(p \wedge(\sim q \vee \sim r)\). By the distributive property for conjunction over disjunction, this statement is equivalent to \((p \wedge \sim q) \vee(p \wedge \sim r)\). Translating the statement \((p \wedge \sim q) \vee(p \wedge \sim r)\) into words, the solution is: "Mom needs to buy chips and Mike did not have friends over, or Mom needs to buy chips and Bob was not hungry."
2. The conditional has the form "If \(p\) or \(q\), then \(r\)," where \(p\) is "Juan had pizza," \(q\) is "Chris had wings," and \(r\) is "Dad watched the game." The negation of \((p \vee q) \rightarrow r\) is \((p \vee q) \wedge \sim r\). By the distributive property for disjunction over conjuction, the statement is equivalent to \((p \vee \sim r) \wedge(q \vee \sim r)\). Translating the statement \((p \vee \sim r) \wedge(q \vee \sim r)\) into words, the solution is: "Juan had pizza or dad did not watch the game, and Chris had wings or dad did not watch the game."
Evaluating De Morgan’s Laws with Truth Tables
In Chapter 1, you learned that you could prove the validity of De Morgan’s Laws using Venn diagrams. Truth tables can also be used to prove that two statements are logically equivalent. If two statements are logically equivalent, you can use the form of the statement that is clearer or more persuasive when constructing a logical argument.
The next example will prove the validity of one of De Morgan’s Laws using a truth table. The same procedure can be applied to any two logical statement that you believe are equivalent. If the last column of the truth table is a tautology, then the two statements are logically equivalent.
Construct a truth table to verify De Morgan’s Law for the negation of a conjunction, , is valid.
- Answer
-
Step 1 : To verify any logical equivalence, you must first replace the logical equivalence symbol, \(\equiv\), with the biconditional symbol, \(\leftrightarrow\). The statement \(\sim(p \wedge q) \equiv \sim p \vee \sim q\) becomes \(\sim(p \wedge q) \leftrightarrow \sim p \vee \sim q\)
Step 2: Next, you create a truth table for the statement. Because we have two basic statements, \(p\), and \(q\), the truth table will have four rows to account for all the possible outcomes. The columns will be \(p, q, \sim p, \sim q, p \wedge q, \sim(p \wedge q), \sim p \vee \sim q\), and the biconditional statement is \(\sim(p \wedge q) \leftrightarrow \sim p \vee \sim q\).T T T F F F F T T F F T F T T T F T F T T F T T F F F T T T T T Step 3: Finally, verify that the statement is valid by confirming it is a tautology. In this instance, the last column is all true. Therefore, the statement is valid and De Morgan's Law for the negation of a conjunction is verified.
1. Construct a truth table to verify De Morgan's Law for the negation of a disjunction, \(\sim(p \vee q) \equiv \sim p \wedge \sim q\), is valid.
Check Your Understanding
1. De Morgan’s Law for the negation of a conjunction states that \(\(\text{~}\left( {p \wedge q} \right)\)is logically equivalent to ___________________.
2. De Morgan’s Law for the negation of a disjunction states that \(\text{~}\left( {p \vee q} \right)\) is logically equivalent to __________________.
3. The negation of the conditional statement, \(\text{~}\left( {p \to q} \right)\), is logically equivalent to _____________.
\(\text{~}\left( {\text{~}\left( {p \to q} \right)} \right) \equiv p \to q\), which means the conditional statement is logically equivalent to \(\text{~}\left( {p \wedge \text{~}q} \right).\) Apply _______________________ to the statement \(\text{~}\left( {p \wedge \text{~}q} \right)\)to show that the conditional statement \(p \to q \equiv \text{~}p \vee q.\)