- Constructive dilemma
-
Rules of inference Propositional calculus Modus ponens (A→B, A ⊢ B)
Modus tollens (A→B, ¬B ⊢ ¬A)
Modus ponendo tollens (¬(A∧B), A ⊢ ¬B)
Conjunction introduction (A, B ⊢ A∧B)
Simplification (A∧B ⊢ A)
Disjunction introduction (A ⊢ A∨B)
Disjunction elimination (A∨B, A→C, B→C ⊢ C)
Disjunctive syllogism (A∨B, ¬A ⊢ B)
Hypothetical syllogism (A→B, B→C ⊢ A→C)
Constructive dilemma (A→P, B→Q, A∨B ⊢ P∨Q)
Destructive dilemma (A→P, B→Q, ¬P∨¬Q ⊢ ¬A∨¬B)
Biconditional introduction (A→B, B→A ⊢ A↔B)
Biconditional elimination (A↔B ⊢ A→B)Predicate calculus Universal generalization
Universal instantiation
Existential generalization
Existential instantiationIn logic, a constructive dilemma is a formal logical argument that takes the form:
- 1a) P → Q.
- b) R → S.
- 2) Either P or R is true.
Therefore, either Q or S is true.
In logical operator notation with three premises
- .
In logical operator notation with two premises[1]
- .
In sum, if two conditionals are true and at least one of their antecedents is, then at least one of their consequents must be too.
An example:
- If I win a million dollars, I will donate it to an orphanage.
- If my friend wins a million dollars, he will donate it to a wildlife fund.
- Either I win a million dollars, or my friend wins a million dollars.
- Therefore, either an orphanage will get a million dollars, or a wildlife fund will get a million dollars.
The dilemma derives its name because of the transfer of disjunctive operants.
Proof
1. 2. 3. (addition) 4. (simplification) 5. (distribution) 6. (DeMorgan's Law) 7. (from assumption) 7. References
- ^ Hurley, Patrick. A Concise Introduction to Logic With Ilrn Printed Access Card. Wadsworth Pub Co, 2008. Page 361
This logic-related article is a stub. You can help Wikipedia by expanding it.