Current reading edition · 2026-09-21

A Fixed-Domain Exhaustion Theorem

Standing, Consequence, and Compositional Closure

Amos Jay Maley · 39 pages

Read paperDownload PDFDOI

Adds compositional coverage and joint-constructor descent to complete semantic profiles; exhausts specified failure-witness families under typed boundary discipline. Separates original obligation coverage, closure and candidate identification.

Earlier versions
About this paper and citation
Imports
Reuses the 20 September Structure profile/interior results with short local proofs. Ref.6 names kernel v49; ref.7 names AMetric editorial reference. ATS is a comparison and is explicitly not assumed.
Supplies downstream
Supplies the finite-use compositional foundation and candidate readout criterion imported by ATS. ATS cites the 20 September composition reference rather than this preferred 21 September publication reference.
Scope and limits
Arbitrary semantic coordinates are not automatically a finite implementation. Candidate-set constant readout, single occupant, and unique decomposition are separate results with separate assumptions. Retaining a failure history does not itself force every later endpoint negative; the edge 0-to-0 condition is additional.

Optional source references - these jump to sections and theorems in this same PDF.

Formalism and dependencies

Amos Jay Maley. A Fixed-Domain Exhaustion Theorem: Standing, Consequence, and Compositional Closure. Publication reference, 2026-09-21. SHA256 d06d39b381edddaafe899f20769b0ba551802b23d7b83121530ecab346feece0. DOI: 10.5281/zenodo.22875070.

Manuscript cover date: 2026-09-21. Publisher release date: 2026-09-21.

SHA256 d06d39b381edddaafe899f20769b0ba551802b23d7b83121530ecab346feece0

Work record (all versions) · Edition metadata · Reading aid as Markdown

The PDF matches the exact publisher release. A complete manuscript HTML conversion has not been verified. A newer reading edition does not replace the exact edition cited by a downstream theorem.