Effective Closure A: Formalising Halting — Finite, Effectively Finite, Decidable, Searchable

Finiteness is not a judgement, closure is not a judgement, and even provablefiniteness is not a judgement. A judgement demands an auditable certificate: anexplicit height bound, the source of that bound, and a termination proof, the threepieces present and explicitly connected, each carrying its dependency items and itsrange. This paper is the first volume of the effective-closure series—the bundlingseries, the audit series, the general halting volume—and it works only at the formalisation layer: a strict separation of the five layers, the construction of thedescriptive-tower formal model M∗, the format specification of the height halting certificate, and the judgement status that a complete or a deficient certificaterespectively earns. The paper states the tri-state theorem inside M∗ and provesit inside the model, gives the self-contained skeleton of the four-layer separationtheorem, and gives a format specification for the height halting certificate; theexistence and uniqueness of the status read-out is closed by Theorem 3 of Chapter 9, and the model foundation is put in place by the formal model of Chapter4. The four-layer separation theorem—effectively finite together with membershipsemi-decision implies decidable; finite without an effective bound does not in general imply decidable; searchable never automatically implies decidable—has its ownledger for each of the three channels, the constructive gap of the second clause isregistered explicitly and anchored to the recursion-theory literature [6]. The fifthlayer, provably finite, registers only the classical proof of finiteness with no boundfunction, so that the quadruple table is never constituted and the tri-state theoremreads it as the declaration tier; it is lower than the searchable tier, which still holdscoordinates registered with absence as their value, whereas provably finite holds notable at all, and this is what gives definitional standing to the opening sentencethat even provable finiteness is not a judgement. The tri-state theorem (Theorem2)—inside M∗, a ready certificate reads as judgement, a missing effective bounddegrades to searchable, a missing source or a missing termination proof degrades todeclaration, and a failed Cons check likewise degrades to declaration, degradationbeing irreversible—is proved by writing out the priority rules of the status function,its uniqueness is closed by Theorem 3 of Chapter 9, and its model foundation isthe formal model of Chapter 4. The paper registers three machine-checked ledgers:the positive ledger of the torsion three-piece set, the double-channel meshing ledgerof the parametrised closure of the Pell equation, and the absence signature of thecomplete certificate for the box search on a genus-two curve; it also registers thebox-search reading for Pell, that inside y ≤ 10000 there are exactly six solutionsunder positive-solution normalisation. The iron rule of the paper is fixed in the sentencing forms for three high-frequency misstatements—finite, therefore decidable;dense, therefore sievable; software ran, therefore proved—each of which has a trueantecedent and an illegal inference, and what sentencing negates is that therefore.The paper does not write the finite as the effective, does not write the searchableas the decidable, and does not write a partial certificate as a complete one.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24409603
Primary Topic
Computability, Logic, AI Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Effective Closure A: Formalising Halting — Finite, Effectively Finite, Decidable, Searchable

changzheng zhou, ziqing zhou
Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
preprint

Effective Closure A: Formalising Halting — Finite, Effectively Finite, Decidable, Searchable

changzheng zhou, ziqing zhou
preprint en

Abstract

Finiteness is not a judgement, closure is not a judgement, and even provablefiniteness is not a judgement. A judgement demands an auditable certificate: anexplicit height bound, the source of that bound, and a termination proof, the threepieces present and explicitly connected, each carrying its dependency items and itsrange. This paper is the first volume of the effective-closure series—the bundlingseries, the audit series, the general halting volume—and it works only at the formalisation layer: a strict separation of the five layers, the construction of thedescriptive-tower formal model M∗, the format specification of the height halting certificate, and the judgement status that a complete or a deficient certificaterespectively earns. The paper states the tri-state theorem inside M∗ and provesit inside the model, gives the self-contained skeleton of the four-layer separationtheorem, and gives a format specification for the height halting certificate; theexistence and uniqueness of the status read-out is closed by Theorem 3 of Chapter 9, and the model foundation is put in place by the formal model of Chapter4. The four-layer separation theorem—effectively finite together with membershipsemi-decision implies decidable; finite without an effective bound does not in general imply decidable; searchable never automatically implies decidable—has its ownledger for each of the three channels, the constructive gap of the second clause isregistered explicitly and anchored to the recursion-theory literature [6]. The fifthlayer, provably finite, registers only the classical proof of finiteness with no boundfunction, so that the quadruple table is never constituted and the tri-state theoremreads it as the declaration tier; it is lower than the searchable tier, which still holdscoordinates registered with absence as their value, whereas provably finite holds notable at all, and this is what gives definitional standing to the opening sentencethat even provable finiteness is not a judgement. The tri-state theorem (Theorem2)—inside M∗, a ready certificate reads as judgement, a missing effective bounddegrades to searchable, a missing source or a missing termination proof degrades todeclaration, and a failed Cons check likewise degrades to declaration, degradationbeing irreversible—is proved by writing out the priority rules of the status function,its uniqueness is closed by Theorem 3 of Chapter 9, and its model foundation isthe formal model of Chapter 4. The paper registers three machine-checked ledgers:the positive ledger of the torsion three-piece set, the double-channel meshing ledgerof the parametrised closure of the Pell equation, and the absence signature of thecomplete certificate for the box search on a genus-two curve; it also registers thebox-search reading for Pell, that inside y ≤ 10000 there are exactly six solutionsunder positive-solution normalisation. The iron rule of the paper is fixed in the sentencing forms for three high-frequency misstatements—finite, therefore decidable;dense, therefore sievable; software ran, therefore proved—each of which has a trueantecedent and an illegal inference, and what sentencing negates is that therefore.The paper does not write the finite as the effective, does not write the searchableas the decidable, and does not write a partial certificate as a complete one.

Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon