The relativized Church-Kleene boundary as a fine-structure bridge

Definitions and mathematical statement

The source-owned item A.8 is Noam Greenberg's participant background statement. It describes training in recursion theory on admissible ordinals, interest in fine structure and inner model theory, and explicitly declines to propose problems. There is no mathematical question to recover. The following parameter-specific bridge is supplied by the research aid and is not attributed to Greenberg as a proposed conjecture.

Work in ZFC. Fix a real oracle $x\subseteq\omega$. An $x$-recursive well-order code is a pair $(D,<_{D})$, with $D\subseteq\omega$ and the relation $<_D$ computable from $x$, that well-orders $D$. Allow finite and empty domains, so finite ordinals and zero are included. Define $\omega_1^x$ to be the least ordinal without such a code, equivalently the supremum of the order types of all $x$-recursive well-order codes. A set is $x$-hyperarithmetic if it is $\Delta^1_1(x)$; hyperarithmetic well-order codes have both domain and order relation of this complexity.

Use the relative constructible hierarchy $L_\alpha[x]$. Call an ordinal $\alpha$ $x$-admissible here if $L_\alpha[x]$, with its oracle predicate, satisfies Kripke--Platek set theory with Infinity, and contains $x$. The aid's synthesis asserts \[ \omega_1^x=\min\{\alpha:L_\alpha[x]\text{ is }x\text{-admissible}\}, \] and that $L_{\omega_1^x}[x]$ is the least transitive admissible set containing $x$, in the sense that it is included in every transitive admissible set containing $x$. Its real subsets of $\omega$ are exactly \[ \mathcal P(\omega)\cap L_{\omega_1^x}[x] =\{y\subseteq\omega:y\in\Delta^1_1(x)\}. \] The admissibility and real-coding conventions are explicit because the source itself supplies none.

The corresponding exact order-type diagnostic is, for every ordinal $\beta$, \[ \begin{aligned} \beta<\omega_1^x &\quad\Longleftrightarrow\quad \exists\text{ an }x\text{-recursive well-order code of type }\beta\\ &\quad\Longleftrightarrow\quad \exists\text{ an }x\text{-hyperarithmetic well-order code of type }\beta. \end{aligned} \] In particular, $\omega_1^x$ itself is countable in the ambient universe but has neither kind of code. External countability gives some set-theoretic coding by a relation on $\omega$; it does not give a presentation recursive or hyperarithmetic in the fixed oracle $x$. These are classical-bridge assertions supplied by the aid, with no new theorem or independent verification claimed here. The registry's open label does not make this participant statement an open problem.

Short English statement

Greenberg's entry supplies background, not a question. The aid adds the relativized Church--Kleene boundary: recursive and hyperarithmetic well-order codes in $x$ realize exactly the ordinals below $\omega_1^x$, which is externally countable but has no such code, and identifies the associated least admissible level.

Sources

• Local registry, permanent UnsolvedMath ID $20002380$, exact public code catalogue entry; canonical location aim-logic-notes.json, notes[155].
• AIM, Recent Advances in Core Model Theory, Chapter A, "Participant Contributions," A.8, "Greenberg, Noam"; supplied reference https://aimath.org/WWN/coremodel/coremodel.pdf. The verification field reports direct prior source checking; none was performed here. No year, original remarks, or literature citation is supplied.
• Supplied research attempt 1: context_only, run status not_a_problem, rigor label proved, low novelty confidence; registry status open, classification OPEN-TRIAGE, created and updated 14 August 2026. The admissibility, hyperarithmetic-real, and order-type assertions are an auxiliary diagnostic synthesis without primary bibliographic references in this record.
• The research aid is explicitly machine generated, not peer reviewed, and requires independent verification before citation.