Domain-Bound Checklist¶
Audit checklist — instantiates Claim Quantifier Scope Calibration
Audits a quantified claim to confirm its domain is declared, its exceptions are named up front, and it never silently expands or contracts mid-argument.
A quantifier ranges over a domain, and most quantifier abuse hides not in the quantifier but in a domain that quietly moves. Domain-Bound Checklist is the audit that nails the domain down: it confirms that the set the claim quantifies over is explicitly declared before the argument starts, that any exceptions are carved out by a stated rule rather than invented case by case, and that the domain stays fixed from the first sentence to the last. Its defining move is that it audits the set, not the force — it does not care whether the claim says "all" or "most," only that whatever it says ranges over a stable, named population. The pathology it exists to kill is the No-True-Scotsman maneuver, where a universal is rescued from every counterexample by silently shrinking the domain to exclude it.
Example¶
A city council passes an ordinance: "No vehicles are permitted in the park." Weeks later a dispute erupts — does it ban bicycles? A memorial jeep mounted on a plinth? An ambulance answering a call? The council's counsel runs the checklist. First: is the domain of "vehicle" declared? It is not, which is the entire problem — the ordinance quantifies "no" over an undefined set.[n1] The checklist forces a written domain (motorized road vehicles operated under their own power) and an explicit exception policy (emergency and maintenance vehicles admitted by permit), rather than leaving officials to decide the ambulance case by improvised reasoning. Finally it opens a scope-shift log so that if a later council argues the mounted jeep "isn't really a vehicle," that contraction is recorded as an amendment to the domain — visible and debatable — instead of a quiet reinterpretation. The claim's force ("no") never changes; only its boundary is made honest.
How it works¶
- Extract and declare the domain. Name the set the quantifier ranges over in writing, converting an implied population ("vehicles") into an explicit membership rule.
- Pre-commit the exceptions. Any carve-out is stated as policy before the argument runs, so exceptions are anticipated rather than manufactured to dodge a counterexample.
- Freeze and monitor the boundary. Establish the domain as fixed for the argument and log every subsequent widening or narrowing as an explicit, dated change rather than a silent slide.
- Flag domain-dependent evidence. Where evidence is drawn from a different population than the declared domain, mark the mismatch so it cannot be smuggled across.
Tuning parameters¶
- Membership sharpness — how crisply the domain boundary is drawn. A bright-line rule is auditable but brittle at edges; a criterial rule bends to hard cases but reopens the drift it was meant to close.
- Exception budget — how many carve-outs the policy tolerates before the claim should simply be renarrowed. A long exception list is a sign the domain was drawn too wide.
- Shift tolerance — whether any domain change voids the claim, or whether logged, justified amendments are allowed. Zero tolerance is rigorous but freezes claims against legitimate refinement.
- Audit depth — a one-pass boundary check versus a running audit across a whole document or argument thread.
When it helps, and when it misleads¶
Its strength is that it converts the most common quantifier fraud — the moving domain — into a visible event. Once the domain is declared and the exception policy is pre-committed, the No-True-Scotsman rescue[n2] becomes impossible to run without leaving a mark in the shift log.
Its failure mode is false confidence from a domain that is declared but wrong: a crisply bounded set can still be the wrong set for the claim's purpose, and the checklist certifies stability, not aptness. The classic misuse is drawing the domain so narrowly that the claim becomes trivially true ("all park vehicles, excluding every vehicle actually in the park, are banned") — precision weaponized into vacuity. The guarding discipline is to check the domain against the claim's stakes: the set has to be the one the decision, policy, or proof actually cares about, not merely a set that is easy to hold still.
How it implements the components¶
domain_of_quantification— its central product: an explicit, written declaration of the set the quantifier ranges over.exception_policy— carve-outs are stated as a rule up front, not improvised against counterexamples.scope_shift_log— every later widening or narrowing of the domain is recorded as an explicit amendment.
It does not weigh whether the evidence meets the quantifier's support_burden_rule or fix the measure_or_count_basis — those belong to the most-threshold statement and exact-N count audit. Its nearest twin is the scope-shift concern of the nested parse, but that one untangles nested_quantifier_order; this checklist fixes the single domain a flat quantifier ranges over.
Related¶
- Instantiates: Claim Quantifier Scope Calibration — supplies the domain-stability guarantee the rest of the appraisal assumes.
- Consumes: Quantified Claim Template supplies the first-pass domain field this checklist then hardens.
- Sibling mechanisms: Nested Quantifier Parse · Negative-Claim Exhaustion Check · Claim Strength Ladder Review
Editorial Notes¶
Form Classification¶
Form family: Assessment, Review & Assurance
Rationale: Domain-Bound Checklist operates as a bounded evaluation of existing evidence or work that produces a finding or disposition because it audits a quantified claim to confirm its domain is declared, its exceptions are named up front, and it never silently expands or contracts mid-argument.
Independent corroboration: The frozen evidence defines Domain-Bound Checklist as 'Audits a quantified claim to confirm its domain is declared, its exceptions are named up front, and it never silently expands or contracts mid-argument', so its operative form is Assessment, Review & Assurance.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Philosophy
Origin pattern: Convergent development
Present-day reach: Universal
Rationale: Philosophical logic cohered explicit quantifier domains, counterexamples, and scope discipline for preventing a universal claim from shifting its universe mid-argument.
Related originating lineages:
- Law & Governance — Legal interpretation developed disciplined rules for jurisdiction, statutory scope, exceptions, and stable class boundaries.
- Linguistics & Semiotics — Formal semantics developed explicit quantifier-domain restriction and scope analysis for natural language.
Review resolution: Philosophical logic is primary, while formal semantics and legal interpretation are genuine parallel scope-control lineages; rhetoric diagnoses abuse but did not cohere the audit method.
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¶
[n1] The philosopher H.L.A. Hart used exactly this "no vehicles in the park" ordinance to show that a rule's general term has a settled core and a contested penumbra — the boundary of the domain is where the real work lives. ↩
[n2] The No True Scotsman move defends a universal by redefining the domain to expel each counterexample ("no true Scotsman would..."). A declared domain plus a shift log is its direct antidote. ↩