Constructive dilemma¶
A valid propositional inference from two conditionals and a disjunction of their antecedents to the disjunction of their consequents.
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.
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. 2. 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) — more general patterns this builds on
-
Constructive dilemma is a kind of Deductive Reasoning Prime
The proposed strict upward parent is
prime:deductive_reasoning.
Hierarchy path (1) — routes to 1 parentless root
- Constructive dilemma → Deductive Reasoning
Neighborhood in Abstraction Space¶
Constructive dilemma sits in a crowded region of the domain-specific corpus (7th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Truth, Semantics & Logical Systems (18 abstractions)
Nearest neighbors
- Logical equality — 0.94
- Disjunctive normal form — 0.93
- Independence of premise — 0.93
- Paraconsistent logic — 0.93
- Proof-theoretic semantics — 0.93
Computed from structural-signature embeddings · 2026-09-08