Negative-Claim Exhaustion Check¶
Search protocol — instantiates Claim Quantifier Scope Calibration
Tests a 'none/never' claim by asking how exhaustively the domain was searched and recording the coverage that backs the absence.
A negative universal — "there are no X," "it never happens," "none of them fail" — is the most expensive quantifier to earn honestly, because it asks you to rule out every case, not to produce one. Negative-Claim Exhaustion Check is the protocol that makes a "none" claim state its price. Its defining move is to treat the strength of a negative claim as a function of search coverage: a "none" is only as strong as the fraction of its domain that was actually examined, so the check demands an exhaustion record — how much of the domain was searched, how, and what was left unlooked. Where an existential is discharged by one case, a negative is discharged only by a search, and this protocol refuses to let "we didn't find any" masquerade as "there are none" without stating the coverage between them.
Example¶
An aircraft certification team asserts: "There is no single failure that can cause an uncommanded full deflection of the rudder." This is a negative claim over a domain of failure modes, and lives or dies on how exhaustively that domain was searched. The exhaustion check forces the coverage on record. The domain is bounded first: single failures within the rudder control chain, under the defined operating envelope. Then the search method and its reach are documented — a fault-tree analysis enumerating each component's failure modes, plus bench testing of the actuator. Crucially, the record also states what was not covered: combinations of two simultaneous faults (out of scope by design), and one supplier subassembly examined only by analysis, not test. The negative claim survives, but now it reads honestly: "no single failure within this chain, under this envelope, found by fault-tree plus actuator test, with dual faults and one subassembly excluded." If a new single-fault mode later surfaces in the unlooked subassembly, the consequence rule fires: the "none" is retracted to "none found outside the following gap," not quietly defended.
How it works¶
- Bound the domain of absence. Fix exactly which population the "none" ranges over before searching, so the claim cannot later shrink to dodge a found case.
- Record the search reach. Document the method and how much of the domain it actually covered — exhaustive enumeration, systematic sweep, or spot check — and label the coverage honestly.
- Log the unlooked. State explicitly what parts of the domain were not searched, because a negative claim's real weakness lives in the gaps it doesn't mention.
- Fire the consequence rule on any hit. A single found case does not merely dent the claim — it falsifies the "none" over the searched region and forces retraction or renarrowing.
Tuning parameters¶
- Coverage target — what fraction of the domain must be searched before "none" may be asserted. Full enumeration yields a strong claim but is often infeasible; a sampled sweep is cheaper but weakens the negative to "none observed."
- Search sensitivity — how good the method is at detecting a case if one exists. A weak instrument produces reassuring absences that mean little.
- Gap disclosure — how completely the unlooked regions are reported. Suppressing gaps inflates the claim; disclosing them is what keeps "none found" from posing as "none exist."
- Retraction threshold — whether one found case retracts the whole claim or only the sub-region it appears in.
When it helps, and when it misleads¶
Its strength is that it directly attacks the most seductive fallacy in negative claims — treating a failure to find as proof of absence — by making coverage an explicit, auditable field. Absence of evidence is not evidence of absence[1] unless the search was thorough enough to have found the thing had it been there, and this protocol is precisely the record of whether it was.
Its failure mode is a thorough search of the wrong domain: a beautifully documented exhaustion record over a mis-drawn population certifies a "none" that is irrelevant to the real question (no single faults, while the actual risk was dual faults all along). The classic misuse is coverage theater — an impressive-looking search whose sensitivity was too low to detect the thing, cited as if reach and sensitivity were the same. The guarding discipline is to report coverage and sensitivity together, and to state the unlooked gaps as prominently as the searched region.
How it implements the components¶
exhaustion_record— its central product: the documented account of how much of the domain was searched, how, and what was left out.domain_of_quantification— it bounds the population the "none" ranges over so the negative cannot silently contract around a found case.counterevidence_consequence_rule— a single found case retracts or renarrows the "none" over the searched region.
It does not build the full quantifier-domain-predicate record, nor untangle nested_quantifier_order — those belong to the quantified claim template and nested quantifier parse. Its nearest twin is the exact-N count audit: both enumerate a domain, but that one certifies an exact positive N via a measure_or_count_basis, whereas this protocol certifies a zero and stakes it on search coverage.
Related¶
- Instantiates: Claim Quantifier Scope Calibration — supplies the negative-claim step of the appraisal.
- Consumes: Quantified Claim Template supplies the domain and negative token the search then tests.
- Sibling mechanisms: Exact-N Count Audit · Universal Counterexample Test · Existential Witness Card
Editorial Notes¶
Form Classification¶
Form family: Assessment, Review & Assurance
Rationale: The mechanism reviews the bounded search domain, documented reach, and unsearched portions to qualify whether a none-or-never claim is supported.
Nearest alternative: Experiment, Test & Rehearsal — A search is performed, but the defining output is an assurance judgment about evidentiary coverage rather than a deliberately varied trial.
Review outcome: Adjudicated after independent review; high confidence.
Origin Attribution¶
Primary origin: Philosophy
Origin pattern: Cross-disciplinary synthesis
Present-day reach: Universal
Rationale: Logic and epistemology supplied the asymmetry between existential and universal-negative claims and the warrant required to infer absence.
Related originating lineages:
- Library & Information Science — Search methodology contributed explicit documentation of corpus scope, retrieval strategy, and unsearched regions.
- Statistics & Experimental Design — Detection probability and sensitivity analysis quantify when a failed search meaningfully supports absence.
Review resolution: Both independent reviews agree on primary origin philosophy; reconciliation resolves alternate_origin_disagreement. Formative alternate lineages retained: library_information_science, statistics_experimental_design. The broader reach of later applications is kept separate as domain_reach=universal; origin_mode=cross_disciplinary_synthesis describes the historical relationship among lineages. Confidence is conservatively reconciled to high, and encyclopedia_synthesis=true preserves the reviewers' boundary judgment.
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.
References¶
[1] MacKenzie, D. I., Nichols, J. D., Lachman, G. B., et al. "Estimating Site Occupancy Rates When Detection Probabilities Are Less Than One". Ecology 83(8), 2248–2255 (2002). Shows that nondetection is not absence unless search effort has enough detection probability to find an occupied site. registry ↩