Modus Ponendo Tollens¶
From the incompatibility of A and B together with A, infer not-B: affirming one jointly forbidden proposition eliminates the other.
Core Idea¶
Modus ponendo tollens is the valid propositional inference that affirms one member of an incompatible pair and thereby denies the other. Its basic nonconjunction form is:
¬(A ∧ B) A therefore ¬B.
The first premise does not say that either proposition must be true. It says only that they cannot both be true. Once A is affirmed, B would make the forbidden conjunction true, so B must be false. E. J. Lemmon describes the rule exactly this way: the negation of a conjunction plus one conjunct yields the negation of the other.
Scope of Application¶
In propositional proof theory, MPT can be adopted as a named primitive transformation or derived from more basic natural-deduction rules. A proof checker may implement it as a convenience rule while verifying that the two cited premises match ¬(A ∧ B) and A up to substitution. A derivation remains sound because the rule preserves truth under every Boolean valuation.
The form is historically important. The Stanford Encyclopedia of Philosophy’s account of Stoic logic lists a third indemonstrable that infers the contradictory of one conjunct from the negation of a conjunction and the other conjunct.
Clarity¶
Use four tests:
- Normalize the first premise. Does it entail ¬(A ∧ B)? “Exactly one,” NAND, and a declared mutual-exclusion constraint do; inclusive OR alone does not. 2. Match the affirmed proposition. The second premise must affirm one of the jointly forbidden propositions, not merely something correlated with it. 3. Negate the other proposition. The conclusion is the contradictory of the remaining proposition, not its contrary, improbability, or absence of evidence.
Manages Complexity¶
MPT compresses a recurring contradiction subproof into one visible inference. Rather than reopening an assumption, building the forbidden conjunction, deriving contradiction, and discharging the assumption each time, a reasoner can cite the incompatibility and the affirmed member directly.
The rule also exposes hidden premise strength. Everyday elimination often sounds like “A happened, so B did not,” but that conclusion is valid only when the incompatibility premise is present.
Abstract Reasoning¶
- If ¬(A ∧ B) and A are true, then B cannot be true; otherwise A ∧ B and its negation would both hold. 2. Swapping A and B yields an equally valid inference because conjunction is commutative. 3. The premise A XOR B entails ¬(A ∧ B), so the exclusive-disjunction form is valid. 4. The premises A ∨ B and A do not entail ¬B; the valuation A=true, B=true is a counterexample.
Knowledge Transfer¶
Exact transfer occurs wherever claims are Boolean and a “not both” constraint is categorical: natural deduction, truth tables, Boolean circuits, SAT solving, rule engines, finite-domain constraints, and formal specifications. Rename A and B, preserve the incompatibility and affirmation roles, and the inference remains valid.
Transfer to ordinary reasoning is licensed only after translating natural-language statements into those roles. Legal exclusivity, resource locking, mutually exclusive classifications, and contest outcomes can supply ¬(A ∧ B), but the domain must justify exclusivity.
Relationships to Other Abstractions¶
Current abstraction Modus Ponendo Tollens Domain-specific
Parents (1) — more general patterns this builds on
-
Modus Ponendo Tollens is a kind of Deductive Reasoning Prime
Deductive Reasoning is the minimal prospective parent.
Hierarchy path (1) — routes to 1 parentless root
- Modus Ponendo Tollens → Deductive Reasoning
Neighborhood in Abstraction Space¶
Modus Ponendo Tollens sits in a sparse region of the domain-specific corpus (85th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Finite-Valued Logic — 0.81
- Conjunction Introduction — 0.81
- Hempel's Paradox — 0.80
- Negation introduction — 0.80
- Harrop Formula — 0.80
Computed from structural-signature embeddings · 2026-09-08