Compiler theorem from the admissibility complex
tfpt-31
Assume the admissible reduced datum summarized in tab:status-matrix, together with the closure theorems of sec:closure-theorems and the conditional closure selection theorem thm:observation-closure. Then every main-text observable in scope is classified by exactly one of the following status classes: exact algebraic, conditional geometric or closure, matched intrinsic observation, optional extrapolation.
Opening source excerpt. Formulas and the full argument remain in the original document.
Source location and explicit evidence links
documents/archive--paper-latex--tfpt-31/sections/015-subsection-compiler-theorem-from-the-admissibility-compl.tex · lines 1 to 28
These are recorded citation relations. A source citation or topic match does not establish a mathematical or physical result.
No explicit verification citation is attached to this section in the registry.