Skip to content

Modus Tollens Checklist

A reasoning method — instantiates Contrapositive Elimination Reasoning

Runs a single conditional through the strict logical form — rewrite 'if A then B' as 'if not-B then not-A', confirm B is absent, and only then conclude A is false.

Version
v1 · 2026-08-24 · History
Mechanism #
5399
Type
Method
Form family
Analysis, Modeling & Optimization
Solution family
Evidence, Inference & Validation
Problem family
Correctness, Conformance & Formal Validity Failure
Problem subfamily
Logical Claim & Derivation Validity
Origin domain
Philosophy
Also from
Mathematics
Instantiates
Contrapositive Elimination Reasoning

The other mechanisms in this archetype gather candidates, tabulate signatures, and judge evidence. Modus Tollens Checklist does none of that — it operates on one conditional at a time and its entire content is the formal move itself: take the rule "if A then B," rewrite it as its logical equivalent "if not-B then not-A," and, given a confirmed absence of B, discharge the licensed conclusion "not-A." Its value is that it makes the deduction airtight and, just as importantly, refuses the two seductive fallacies that live next door — affirming the consequent and denying the antecedent. It guarantees the step is valid; it deliberately says nothing about whether the rule is true.

Example

An electrician is called to a dead wall outlet. One candidate cause is a tripped breaker. The rule is stated precisely: "If the breaker for this circuit had tripped, then every outlet on the circuit would be dead." The checklist rewrites it as the contrapositive: "If some outlet on this circuit is still live, then the breaker did not trip." The electrician checks the next outlet on the same circuit — it powers a lamp fine. That live outlet is a confirmed not-B, so the licensed conclusion is not-A: the breaker did not trip, and it comes off the list.

The checklist's last step is the one that separates it from a hunch: it forces the validity guard. Are these outlets actually on the same circuit? If the "dead outlet" were on a different breaker, the conditional never applied and the elimination is void. The form is only as good as the conditional it runs on — which is exactly why the checklist keeps the logical move and the truth of the rule as two separate questions.

How it works

  • State the conditional exactly — pin down A and B so "B is absent" is a checkable claim, not a vibe.
  • Rewrite as the contrapositive — turn "if A then B" into the logically equivalent "if not-B then not-A." This is the whole transformation, and it is truth-preserving by form.
  • Guard against the invalid cousins — confirm you are denying the consequent (observing not-B), not affirming it (observing B and inferring A) or denying the antecedent (observing not-A and inferring not-B). These are the two errors the checklist exists to catch.
  • Discharge the inference — with not-B confirmed, conclude not-A, and stop. The checklist does not judge how trustworthy the "not-B" observation is; it takes it as given.

Tuning parameters

  • Conditional strictness — whether the rule is treated as a strict implication, a biconditional, or a defeasible tendency. Strict licenses a clean elimination; defeasible downgrades the move to a probabilistic lean. Strictness buys certainty, but most real-world rules are not actually strict.
  • Consequent granularity — how finely B is specified. A sharp, narrow B is easier to confirm absent, but a narrow B is more likely to have hidden exceptions that break the rule.
  • Burden of proof placement — run it as a one-shot manual check on a single rule, or embed it as a reflex applied to every conditional in an argument.

When it helps, and when it misleads

Its strength is that it is the cheapest rigor available: a thirty-second rewrite that catches the fallacies people fall into precisely because affirming the consequent feels like valid reasoning.[n1] When a rule is genuinely strict and a not-B is genuinely observed, no elimination is more certain.

Its failure mode is that a perfectly valid form can run on a rotten premise. People apply the flawless move to a conditional that was never true — one riddled with unstated exceptions — and get a confidently wrong elimination; the logic is impeccable and the answer is garbage. The classic misuse is asserting the contrapositive of a merely correlational or defeasible rule as if it were strict ("if it were a real problem, someone would have reported it"). The discipline that guards against this is to keep validity and soundness separate: verify the conditional's truth and screen it for exceptions before trusting the deduction — the job this checklist deliberately hands off to its siblings.

How it implements the components

Modus Tollens Checklist realizes only the pure-logic core of the archetype — the transformation and the deduction:

  • equivalence_rewrite_note — its central artifact: the note that rewrites "if A then B" into the logically equivalent "if not-B then not-A," the move that makes an absence usable.
  • contrapositive_inference_step — it discharges the actual deduction: not-B confirmed, therefore not-A, with the fallacy guard applied.

It does not record the forward rule set or enumerate the candidates in play (forward_implication_record, antecedent_candidate_set — that's Required Consequence Table); it does not judge whether the "not-B" observation is trustworthy (detectability_and_scope_check, absence_evidence_threshold — that's Negative-Evidence Reliability Review); and it does not screen the rule for exceptions (exception_and_defeater_list — that's Falsification Test Harness).

Editorial Notes

Form Classification

Form family: Analysis, Modeling & Optimization

Rationale: The checklist performs a formal truth-preserving transformation to the contrapositive and infers not-A only after verifying not-B and excluding invalid forms.

Nearest alternative: Assessment, Review & Assurance — It includes correctness checks, but its defining output is a logical inference rather than a fitness or compliance disposition on existing work.

Review outcome: Adjudicated after independent review; high confidence.

Origin Attribution

Primary origin: Philosophy

Origin pattern: Single lineage

Present-day reach: Universal

Rationale: Modus tollens is a canonical inference rule from ancient and formal logic within philosophy.

Related originating lineages:

  • Mathematics — Mathematical logic provides modern symbolic formalization and proof practice.

Review resolution: Both independent reviews agree on primary origin philosophy; reconciliation resolves secondary fields (encyclopedia_synthesis_disagreement). Alternate origins retained (mathematics) are the union of reviewer-supported formative lineages with explicit rationales, not a list of later application domains. Present-day breadth is represented separately as domain_reach=universal; origin_mode=single_lineage records the historical relationship among lineages. Confidence is conservatively reconciled to high, and encyclopedia_synthesis=true preserves either reviewer's finding that the encyclopedia generalized the mechanism.

Encyclopedia synthesis: The exact catalogued form synthesizes established practice rather than reproducing a single standard historical label.

Review outcome: Reconciled after independent review; high confidence.

Notes

The checklist guarantees validity, not soundness. It certifies that if the conditional holds and if B is truly absent, then not-A follows — but it owns neither premise. That boundary is deliberate: it lets a team reuse one trustworthy logical form across every domain while delegating the two hard, domain-specific questions (is the rule true? is the absence real?) to the mechanisms built for them.

[n1] Modus tollens — the valid argument form "if A then B; not-B; therefore not-A." Its invalid look-alikes are affirming the consequent ("if A then B; B; therefore A") and denying the antecedent ("if A then B; not-A; therefore not-B"). The checklist's guard step exists to keep the valid form from being confused with these.