Mathwords logoMathwords

Destructive Dilemma — Definition & Example

Destructive dilemma is a valid argument form. If you have two if-then statements and you know at least one of their conclusions fails, you may conclude that at least one of their hypotheses fails.

In propositional logic, destructive dilemma is the rule of inference that derives ¬P∨¬R\neg P \lor \neg R from the premises P→QP \to Q, R→SR \to S, and ¬Q∨¬S\neg Q \lor \neg S. Equivalently, [(P→Q)∧(R→S)∧(¬Q∨¬S)]→(¬P∨¬R)[(P \to Q) \land (R \to S) \land (\neg Q \lor \neg S)] \to (\neg P \lor \neg R) is a tautology. It applies modus tollens to each disjunct of ¬Q∨¬S\neg Q \lor \neg S, so it is the case-by-case form of modus tollens.

Key Formula

P→QR→S¬Q∨¬S∴ ¬P∨¬R\begin{array}{l} P \to Q \\ R \to S \\ \neg Q \lor \neg S \\ \hline \therefore\ \neg P \lor \neg R \end{array}
Where:
  • P,RP, R = Hypotheses (antecedents) of the two conditionals
  • Q,SQ, S = Conclusions (consequents) of the two conditionals
  • ¬\neg = Negation (not)
  • ∨\lor = Inclusive or: at least one side is true

Example

Problem: Assume these three premises about real numbers x and y. (1) If x = 3, then x² = 9. (2) If y = 4, then y² = 16. (3) x² ≠ 9 or y² ≠ 16. What can you validly conclude about x and y?
Step 1: Match the premises to the form. Let P be x = 3, Q be x² = 9, R be y = 4, and S be y² = 16. Premises (1) and (2) are true because 3² = 9 and 4² = 16. Premise (3) has the form ¬Q ∨ ¬S.
P→Q,R→S,¬Q∨¬SP \to Q,\quad R \to S,\quad \neg Q \lor \neg S
Step 2: Reason by cases on premise (3). If x² ≠ 9, then modus tollens on (1) gives x ≠ 3. If y² ≠ 16, then modus tollens on (2) gives y ≠ 4. In either case, at least one of these conclusions holds.
¬Q⇒¬P,¬S⇒¬R\neg Q \Rightarrow \neg P, \qquad \neg S \Rightarrow \neg R
Step 3: Combine the two cases into a single disjunction.
¬P∨¬R\neg P \lor \neg R
Answer: You may conclude that x ≠ 3 or y ≠ 4. At least one of these is true, and possibly both are.

Why It Matters

Destructive dilemma appears in the list of standard inference rules in college discrete math and intro logic courses. You use it in proofs whenever you know that one of two consequences fails but not which one. It is the mirror image of constructive dilemma, which affirms antecedents instead of denying consequents.

Common Mistakes

Mistake: Concluding that both hypotheses are false, writing ¬P ∧ ¬R instead of ¬P ∨ ¬R.
Correction: The premise ¬Q ∨ ¬S only tells you that at least one consequent fails, so you only learn that at least one antecedent fails. Take x = 3 and y = 5. All three premises hold, because y² = 25 ≠ 16. Yet x ≠ 3 is false. Keep the conclusion as a disjunction.

Related Terms

  • Conditional — Both premises P → Q and R → S are conditionals
  • Contrapositive — Explains why denying each consequent denies its antecedent
  • Disjunction — Third premise and the conclusion are both disjunctions
  • Conjunction — Mistakenly used in place of the disjunctive conclusion
  • Conclusion — Names the consequents Q and S that get denied
  • Counterexample — Shows that concluding both antecedents false is invalid