Contradiction Search Checklist¶
Heuristic checklist — instantiates Contradiction-Closure Proof
A diagnostic list of the standard forms impossibility takes, run against a supposition to find, name, and validate a genuine contradiction rather than a mere surprise.
Contradiction Search Checklist answers the hardest practical question in an indirect proof: once I've assumed the opposite, where do I look for the impossibility? It is a heuristic inventory of the recurring shapes a contradiction takes — direct P and ¬P, a violated invariant, an impossible inequality, an empty case set, an unsatisfiable constraint set, incompatible commitments — plus a short set of validity gates that screen out false alarms. Its distinctive job is recognition, not derivation: it does not build the chain of inferences, it tells you what a real contradiction would look like when the chain arrives at one, and it flags the two things that most often masquerade as contradictions — a merely surprising result, and an "impossibility" that is only impossible in a logic you have not licensed. A surprise is not a contradiction; the checklist is the discipline that keeps the two apart.
Example¶
A distributed-systems designer claims their commit protocol "can never leave two replicas holding different committed values." Assuming the opposite — two replicas commit different values — she walks the checklist. Direct P and ¬P? Not yet. Violated invariant? Yes, candidate: the quorum-intersection invariant says any two commit quorums share a node. Trace it: that shared node would have voted to commit both values, but the protocol's rule forbids a node voting twice in one round — a direct incompatibility. Validity gate — does this hold in the model's logic? Yes, it is a plain propositional clash, no exotic inference needed. Gate — does it depend on the supposition, not a background bug? Yes; the accepted rules alone are consistent.
The checklist did not prove anything; it located the impossibility (quorum intersection meets single-vote rule) and certified it was the genuine article rather than a design smell. That is what let the designer hand a sharp contradiction to a derivation mechanism to formalize, instead of hunting blindly.
How it works¶
- Pin the target and its exact negation first. The search is only meaningful against a sharply stated claim, so the checklist opens by fixing what is being denied.
- Sweep the catalog of impossibility forms. Run down the standard shapes — contradictory pair, broken invariant, numeric impossibility, empty/duplicated case set, unsatisfiable constraints — testing each against the supposition's consequences.
- Apply the validity gates. For any candidate: is it a genuine logical clash and not mere improbability or paradox? Does it depend on the supposition rather than a pre-existing inconsistency? Is it valid in the logic actually in force?
- Name the winner. Record which form the contradiction took, so downstream derivation and closure attach to a specific impossibility.
Tuning parameters¶
- Catalog breadth — how many impossibility forms the sweep covers. A fuller catalog catches subtle clashes but lengthens every search.
- Gate strictness — how hard the "is this really a contradiction?" screens push. Stricter gates reject more false positives but risk discarding a valid subtle one.
- Logic sensitivity — how aggressively it flags criteria that hold only classically. High sensitivity protects constructive contexts; low sensitivity speeds a routine classical proof.
- Search order — whether to test cheap forms (direct pair) before expensive ones (constraint unsatisfiability). Ordering trades early exits against completeness.
When it helps, and when it misleads¶
Its strength is that it disciplines the fuzziest step of the archetype: it stops teams from treating empirical improbability or an apparent paradox as logical impossibility, and its logic gate is a guard against invoking the principle of explosion[n1] in a setting where contradiction does not license classical closure. It turns "that can't be right" into a named, categorized impossibility.
Its failure mode is that a checklist finds candidates, not proofs: a form that looks like a contradiction can dissolve once the derivation is made rigorous, and an over-eager searcher can pattern-match a clash that a careful inference would not sustain. It can also miss an impossibility that fits no catalogued shape. The guarding discipline is to treat every hit as a hypothesis to be discharged by an actual derivation, and to keep the logic gate honest — a contradiction is only as valid as the system that recognizes it.
How it implements the components¶
Contradiction Search Checklist realizes the recognition-and-screening side of the archetype:
target_claim_statement— the search opens by pinning the claim and its exact negation, since impossibility is only defined relative to them.contradiction_criterion— the catalog of impossibility forms is the criterion: it enumerates and names what counts as a contradiction here.logic_exception_marker— the validity gates flag criteria that hold only in a particular logic, marking where classical closure is not licensed.
The checklist locates and validates a contradiction but does not construct the rule-typed inference chain that reaches it (derivation_path) — that is Natural Deduction Proof Tree; the checklist tells the tree what to aim for.
Related¶
- Instantiates: Contradiction-Closure Proof — supplies the disciplined contradiction-recognition the archetype's precision invariant needs.
- Sibling mechanisms: Reductio Proof Template · Natural Deduction Proof Tree · Assumption Ledger · Minimal Unsat Core Analysis · Case-Split Elimination Table · Peer Proof Review · Proof Assistant Script · Unsatisfiability Certificate
Editorial Notes¶
Form Classification¶
Form family: Assessment, Review & Assurance
Rationale: A diagnostic list of the standard forms impossibility takes, run against a supposition to find, name, and validate a genuine contradiction rather than a mere surprise, making its operative form a bounded evaluation of existing evidence or work that produces a finding or disposition.
Independent corroboration: The frozen evidence defines Contradiction Search Checklist as 'A diagnostic list of the standard forms impossibility takes, run against a supposition to find, name, and validate a genuine contradiction rather than a mere surprise', so its operative form is Assessment, Review & Assurance.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Mathematics
Origin pattern: Single lineage
Present-day reach: Specialized
Rationale: Mathematical proof practice cohered systematic contradiction search as an indirect method, with philosophical logic supplying its interpretation and boundary conditions.
Related originating lineages:
- Philosophy — Philosophical logic supplies the distinction between genuine contradiction, paradox, improbability, and logics that reject explosion.
Review resolution: The checklist operationalizes the mathematical proof-by-contradiction pattern—assume or locate incompatible claims and derive an absurdity—while philosophical logic materially supplies the broader treatment of contradiction and nonclassical exceptions. MIT proof guidance and the Stanford logic reference support mathematics as the primary procedural lineage without treating every debugging application as an origin.
Encyclopedia synthesis: The exact catalogued form synthesizes established practice rather than reproducing a single standard historical label.
Review outcome: Researched adjudication after independent review; high confidence.
Sources consulted:
Notes¶
[n1] The principle of explosion (ex contradictione quodlibet) — from a contradiction, anything follows — is the classical rule that makes a single contradiction fatal to a system. Paraconsistent logics reject it; the checklist's logic gate exists precisely so this rule is not assumed where it does not hold. ↩