Effective Closure C; Effective Islands- The Topography of the Height Halting Certificate
The island map of the height halting certificate registers certificate states ina five-column format: island name, bound, source, termination proof, and scope.Four readings cover the three forms a certificate may take: two machine-checkedclosed readings, on the genus-zero island and on the rank-zero island; one signaturereading, on the Baker island; and one certificate-free reading, the mainland row. Amachine-checked closed reading is one whose enumeration domain, decision functionand acceptance criterion are all in place and whose clamping closes; a signaturereading is one whose hit set under box enumeration can be rechecked point bypoint while the effective-bound certificate on which completeness rests has notlanded; a certificate-free reading registers a phenomenon only and claims no boundat all. The three-tier reading convention is distinguished in Chapter 9, and aconvention mismatch is corrected under the consistency-of-expression dispositiontier. To close the normative gap between the evidence checklist and the five-columnformat, the paper introduces a certificate-state discriminator as a single device thatclassifies any one certificate uniquely into exactly one of three states—complete,existence-anchored with numerical absence, or absent—and it states the misreadingprohibitions between the three states together with a verification template for crosstype citation. The discriminator takes the four readings as regression cases andexhibits the judgement path for each of them. The value of the island map liesnot in a claim that the mainland shrinks but in the precision of the audit: everycertificate has a state, every extrapolation has a disposition, and every absent rowhas a signature.
Authors
- changzheng zhou (ORCID: https://orcid.org/0009-0002-4186-7877)
- ziqing zhou (ORCID: https://orcid.org/0009-0005-6883-6300)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-22
- DOI
- https://doi.org/10.5281/zenodo.24431037
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- preprint