# Non-Degenerate Construction and the Kernel of Admissibility: An Exhaustion Theorem for Standing, Reference, and Irreversibility

Reference edition; manuscript cover date 2026-09-26; publisher release date 2026-09-25; 73 PDF pages.

**Attributed reading aid, not a complete manuscript conversion or independent proof verification.**

Amos Jay Maley. Non-Degenerate Construction and the Kernel of Admissibility: An Exhaustion Theorem for Standing, Reference, and Irreversibility. Reference edition, 2026-09-26. SHA256 4e1bafc4844d90ca7ba5268d1b6b5ee21bf92f082a2a61b4eea039faed0c037e. DOI: 10.5281/zenodo.22968658.

[Read the exact PDF](https://constraintsystemsinstitute.org/manuscripts/kernel/sha256-4e1bafc4844d90ca7ba5268d1b6b5ee21bf92f082a2a61b4eea039faed0c037e/manuscript.pdf)

## Imports

Begins with non-degenerate determinate construction and original incidence. It does not assume the downstream binary interface, occupancy or ATS decomposition as premises.

## Establishes

The manuscript derives necessary Admissibility, Standing, Reference and Irreversibility roles from incurred objecthood obligations, and proves functional minimality and same-object exhaustion. Exact realization requires preservation of original observations through the encoding fibres.

## Supplies downstream

Supplies a kernel necessity argument and a representation-faithfulness criterion. Downstream September papers cite version 49, rather than the preferred 26 September PDF.

## Scope and limits

The functional roles are not an optional overlay. Agreement under complete queries requires independent individual warrants. Unique or absent outcomes are not a blanket assertion about all research or every question; semantic absence is not computational timeout.

## Evidence

- [Proposition 2.4, PDF pp. 14–17](https://constraintsystemsinstitute.org/manuscripts/kernel/sha256-4e1bafc4844d90ca7ba5268d1b6b5ee21bf92f082a2a61b4eea039faed0c037e/manuscript.pdf#page=14)
- [Theorem 2.8 / Corollary 2.9, PDF pp. 20–21](https://constraintsystemsinstitute.org/manuscripts/kernel/sha256-4e1bafc4844d90ca7ba5268d1b6b5ee21bf92f082a2a61b4eea039faed0c037e/manuscript.pdf#page=20)
- [Theorem 3.1 / Theorem 3.6, PDF pp. 24–27](https://constraintsystemsinstitute.org/manuscripts/kernel/sha256-4e1bafc4844d90ca7ba5268d1b6b5ee21bf92f082a2a61b4eea039faed0c037e/manuscript.pdf#page=24)
- [Sections 6.2-6.5, PDF pp. 35–37](https://constraintsystemsinstitute.org/manuscripts/kernel/sha256-4e1bafc4844d90ca7ba5268d1b6b5ee21bf92f082a2a61b4eea039faed0c037e/manuscript.pdf#page=35)
- [Theorem 7.1 / Section 7.1, PDF pp. 41–43](https://constraintsystemsinstitute.org/manuscripts/kernel/sha256-4e1bafc4844d90ca7ba5268d1b6b5ee21bf92f082a2a61b4eea039faed0c037e/manuscript.pdf#page=41)