correspondence at parkeremmerson@icloud. com This paper develops a selected-witness metatheory for the Riemann Hypothesiswhich separates four levels that are often conflated: the raw formula containing\ ( () \), the analytically selected classical RH proposition, the exact\ (\) -certificate calculus, and the global metatheory of proof, disproof, independence, and resolution procedures. At the clause-prior level, the raw strip formula\: s ( (01\). Under strict atomic strong Kleenesemantics, \[=, the definedness-guarded formula is true by definedness-vacuity. Acrossarbitrary strip-total completions every subset of the critical strip is realizableas a zero-set of the raw \ (\) -symbol. Hence the raw formula has noclause-prior bivalent sign and no completion-invariant bivalent sign. Analytic continuation is therefore treated as a selector and formation operation: it forms the selected classical proposition\: , \ (\) is the unique analytically coherent evaluator agreeing with theDirichlet series on \ ( (s) >1\). The selected RH package constructed here has exact positive and negative witnessfibres. The negative fibre is finite-certificate based: \ w\, (w), \ ( (w) \) is a decidable finite exact-count certificate predicate foran off-critical zero of the Riemann \ (\) -function. The positive fibre isall-stage: \ n\, c\, (n, c), \ ( (n, c) \) is a decidable half-plane zero-free certificatefor the \ (n\) -th stage window in the RH-relevant \ (\) -plane. A finitecomputation-history checker gives a literal \ (₁\) arithmetic representative\: w\, u\, (w, u), \ N. \ The proof-status calibration of this representative is sharp on the negativeside. If \ (\), then every \ (T\) proves\. , T (). \ (T\) is \ (₁\) -sound, then. \ The validated-numerics backend is included theorem-level and constructively. Thecompleted \ (\) -function is defined as the entire removable extension of\12s (s-1) ^-s/2 (s/2) (s), the backend gives uniform rational enclosures for \ (^ (j) \), \ (0 j3\), on compact subsets of the RH-relevant region. The correctedenclosure theorem is a shrinking-domain theorem: on compact guards, an enclosureradius for \ (^ (j) (D) \), \ (j2\), is bounded by a compact derivative boundfor \ (^ (j+1) \) times \ ( (D) \), plus a precision term. The appendices giveexplicit rational interval algorithms, Euler--Maclaurin and gamma-polygamma tailbounds, theta-kernel truncation bounds, and validated quadrature estimates. The winding certificate is formulated as a parameterized tube-homotopycertificate. A rational polygonal loop \ (P\) is supplied together with a boundarypartition and zero-avoiding rational image disks \ (Eᵢ\) such that both\ ( ( (tᵢ, t₈+₁) ) \) and \ (P (tᵢ, t₈+₁) \) lie in \ (Eᵢ\). Thestraight-line homotopy inside the convex disks \ (Eᵢ C^\) gives rigorous winding soundness. The paper proves global metatheorems: Selection Jump for occupied stagewise-localsuccess classes, computable triage failure, reflection collapse, Tarski anddiagonal barriers, finite-prefix nonclosure, finite-interface nonclosure, andlegacy support-filter laundering. The no-transfer theorem is sharpened to a maximal a-priori selected-logicaluniform-nullity theorem. The Dirichlet-clause formula has no bivalent resolvent, \_ () =; bivalent sign is invariant across strip completions, \ ₂_ () =;, for every consistent recursively axiomatizable\ (T\), after analytic selection and exact witness packaging, themaximal selected-logical invariant uniform fixed-instance resolvent remainsempty, \T^ (;) =. \ (\) denotes the full selected-logical invariant closure of exactselected packages, not merely a list of theorem schemes proved up to a stage. Thesuperscript \ (\) emphasizes that this is a uniform consequence relation overall exact selected packages: it is not the set of all actual metamathematicalfacts about the particular sentence \ (\). Thus, after all a-prioriselected-logical invariant consequences are included, the intersection with theuniformly forced fixed-instance label set\\True, False, ProvT, RefT, UnprovT, UnrefT, IndT\ empty. This is an unconditional no-forcing theorem for the maximal invariantselected-logical closure, not a statement of failed proof search.
Parker Emmerson (Wed,) studied this question.