Read the objects and logical claim in De Morgan’s laws
Identify the set, index, graph, counting object, or proposition first. Then separate what is assumed from what is being counted or proved. Rebuild missing background in the discrete math subject guide, then use discrete math practice to retrieve the relationship without being told its name.
State the finite, integer, or logical conditions
It applies only to the outermost connective at each step. In not(P and (Q or R)) the first move gives not P or not(Q or R), and the leftover negation must be pushed in again; stopping halfway leaves a statement that is not fully simplified and often gets misread.
Test De Morgan’s laws on a small case
List or draw a small instance before relying on the general notation:
Extend the small case to the general structure
- Name the unknown, and the unit the answer has to come out in.
- Match the symbols to your values. $P,Q$ are propositions.
- Check the conditions before substituting. Apply the negation to every component, including quantified statements.
- Substitute, keep exact values to the last line, then test the sign, size, and unit against a rough estimate - The check that catches most discrete math slips.
Check boundaries, overlap, and base cases
After using De Morgan’s laws, repeat the calculation with units attached and test the result against a boundary case or a quick numerical estimate.
A counting or logic mistake to catch
What goes wrong: Students push the negation inside and leave the connective alone, writing not(P and Q) as not P and not Q.
Why it fails: That claims both parts fail, which is much stronger than the original. Take P true and Q false: the real negation is true because the and statement failed, but the rewritten version is false.
Repair: Change the connective every time the negation moves in. Not both means at least one is missing, so not(P and Q) becomes not P or not Q, and a two-line truth table settles any doubt.
Questions about De Morgan’s laws
What is the negation of every cat is grey?
Some cat is not grey. Negating a for-all statement turns it into a there-exists statement about the opposite property, which is the quantifier version of these same laws.
Does it work with three or more statements?
Yes, and it applies all the way along. Not(P and Q and R) becomes not P or not Q or not R, because a single failure anywhere is enough to sink the whole chain.
How does the set version look?
The complement of a union is the intersection of the complements, and the complement of an intersection is the union of the complements. It is the same statement with or replaced by union and and replaced by intersection.
What is the negation of 3 < x < 5?
That double inequality means x > 3 and x < 5, so its negation is x ≤ 3 or x ≥ 5. Students often write 3 ≥ x ≥ 5 by mistake, which describes no number at all.
Change one input, predict whether the output should rise, fall, or stay fixed, and only then recalculate.