Constructive dilemma¶

A valid propositional inference from two conditionals and a disjunction of their antecedents to the disjunction of their consequents.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3869
Domain group: Humanities
Origin domain: Philosophy
Subdomain: Formal Logic → Philosophy

Core Idea¶

Constructive dilemma has the form (P→Q), (R→S), and (P∨R), therefore (Q∨S), combining disjunctive elimination with conditional reasoning. The disjunctive premise guarantees at least one antecedent; the matching conditional then guarantees its consequent, so at least one consequent holds without determining which branch. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of formal logic. It is the domain-specific identity determined by both conditionals and the antecedent disjunction hold under the same propositional interpretation, making the consequent disjunction truth-preserving.

How would you explain it like I'm…

Either Way Something Happens

If it rains, we'll play inside. If it's sunny, we'll go to the park. And we know it will be either rainy or sunny. So we can be sure we'll either play inside or go to the park, even though we don't know yet which one. That way of thinking is a constructive dilemma.

Two Ifs and an Or

A constructive dilemma is a way of reasoning with two 'if-then' rules and an 'either-or.' Rule one: if A happens, then B happens. Rule two: if C happens, then D happens. And we know that A or C will happen. So we can be sure that B or D will happen. We just can't say which one, because we don't know which of A or C it was.

Reasoning by Cases With Two Conditionals

A constructive dilemma is a valid argument form in logic: from 'If P then Q,' 'If R then S,' and 'P or R,' you can conclude 'Q or S.' It works because the 'or' premise guarantees that at least one of P or R is true, and whichever one it is, its matching 'if-then' delivers its result. The conclusion only says that at least one of Q or S is true; it does not tell you which. It combines ordinary if-then reasoning with reasoning by cases. For it to be valid, all three premises have to be about the same statements with the same meanings throughout.

Constructive dilemma is the propositional inference form (P→Q), (R→S), (P∨R) ⊢ (Q∨S). It combines disjunctive elimination, or proof by cases, with conditional reasoning: the disjunctive premise guarantees that at least one antecedent holds, and the corresponding conditional then guarantees its consequent. The conclusion is therefore the disjunction of the consequents, with no information about which branch obtains. The form is truth-preserving provided both conditionals and the antecedent disjunction hold under the same propositional interpretation; mixing interpretations, or substituting a neighboring form, breaks the guarantee. The key feature distinguishing it from simple modus ponens is that it reasons across two branches at once and yields only a disjunctive conclusion.

Scope of Application¶

Constructive dilemma belongs to formal logic and is useful where the analyst can specify the typed formal logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate both conditionals and the antecedent disjunction hold under the same propositional interpretation, making the consequent disjunction truth-preserving. The scope is broad within that domain but bounded by the need for both conditionals and the antecedent disjunction hold under the same propositional interpretation, making the consequent disjunction truth-preserving. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making both conditionals and the antecedent disjunction hold under the same propositional interpretation, making the consequent disjunction truth-preserving the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Constructive dilemma can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Constructive dilemma. Constructive dilemma compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed formal logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express both conditionals and the antecedent disjunction hold under the same propositional interpretation, making the consequent disjunction truth-preserving independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of formal logic because they reuse the typed formal logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, The disjunctive premise guarantees at least one antecedent; the matching conditional then guarantees its consequent, so at least one consequent holds without determining which branch., and type the carrier, state every parameter and convention in the definition, test that both conditionals and the antecedent disjunction hold under the same propositional interpretation, making the consequent disjunction truth-preserving, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Constructive dilemma Domain-specific

Parents (1) — outgoing typed relations

Constructive dilemma is a kind of Deductive Reasoning Prime

What makes it its own entry: the domain-specific identity determined by both conditionals and the antecedent disjunction hold under the same propositional interpretation, making the consequent disjunction truth-preserving.

Hierarchy path (1) — routes to 1 parentless root

Constructive dilemma → is a kind of Deductive Reasoning

Neighborhood in Abstraction Space¶

Constructive dilemma sits in a crowded region of the domain-specific corpus (4^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Formal Logic & Computation Systems (24 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25