Philosophy:Constructive dilemma

Short description: Rule of inference of propositional logic

Constructive dilemma

Type	Rule of inference
Field	Propositional calculus
Statement	If [math]\displaystyle{ P }[/math] implies [math]\displaystyle{ Q }[/math] and [math]\displaystyle{ R }[/math] implies [math]\displaystyle{ S }[/math], and either [math]\displaystyle{ P }[/math] or [math]\displaystyle{ R }[/math] is true, then either [math]\displaystyle{ Q }[/math] or [math]\displaystyle{ S }[/math] has to be true.

Constructive dilemma is a valid rule of inference of propositional logic. It is the inference that, if P implies Q and R implies S and either P or R is true, then either Q or S has to be true. 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. Constructive dilemma is the disjunctive version of modus ponens, whereas, destructive dilemma is the disjunctive version of modus tollens. The constructive dilemma rule can be stated:

[math]\displaystyle{ \frac{(P \to Q), (R \to S), P \lor R}{\therefore Q \lor S} }[/math]

where the rule is that whenever instances of "[math]\displaystyle{ P \to Q }[/math]", "[math]\displaystyle{ R \to S }[/math]", and "[math]\displaystyle{ P \lor R }[/math]" appear on lines of a proof, "[math]\displaystyle{ Q \lor S }[/math]" can be placed on a subsequent line.

Formal notation

The constructive dilemma rule may be written in sequent notation:

[math]\displaystyle{ (P \to Q), (R \to S), (P \lor R) \vdash (Q \lor S) }[/math]

where [math]\displaystyle{ \vdash }[/math] is a metalogical symbol meaning that [math]\displaystyle{ Q \lor S }[/math] is a syntactic consequence of [math]\displaystyle{ P \to Q }[/math], [math]\displaystyle{ R \to S }[/math], and [math]\displaystyle{ P \lor R }[/math] in some logical system;

and expressed as a truth-functional tautology or theorem of propositional logic:

[math]\displaystyle{ (((P \to Q) \land (R \to S)) \land (P \lor R)) \to (Q \lor S) }[/math]

where [math]\displaystyle{ P }[/math], [math]\displaystyle{ Q }[/math], [math]\displaystyle{ R }[/math] and [math]\displaystyle{ S }[/math] are propositions expressed in some formal system.

Natural language 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 operator.