Skip to main content
6 of 8
I fixed an error in the proof.
喻 良
  • 4.2k
  • 1
  • 21
  • 30

The following is not the answer of your question. But I think it is what you really want.

I guess you might be figuring out Leo's proof of McLaughlin's conjecture and his answer to Question 65 in Harvey's problem collection paper. The point is that by applying a nonstandard ordinal, Leo obtained a nonstandard $\Pi^0_1$-singleton so that it is not hyperarithmetic.

There are several ways to see above. One is by applying Barwise compactness. Another is to use Gandy's basis. By either way, you may obtain a nonstandard $\omega$-model $M$ of KP with $\omega_1^M=\omega_1^{CK}$ in which there is a nonhyperarithmetic (in the real sense) $\Pi^0_1$-singleton $x$ which has the property below.

(To see it by Gandy's basis theorem. Just apply it to obtain an $\omega$-model $M\models KP$ in which $\omega_1^{CK}$ is nonstandard. In $M$, fix a nonstandard recursive ordinal $\alpha$, we can perform Leo's proof to produce a nonhyperarithmetic $\Pi^0_1$-singleton $x$ so that for any $\beta<\alpha$, those reals computed by $x^{\beta}$ and $\emptyset^{\alpha}$ are precisely those computed by $\emptyset^{\beta}$).

Now take $N=L_{\omega_1^{CK}}[x]$. Since $x\leq_h M$, we have that $N\models KP$. It is not difficult to see that $N\models$ ''$x$ is a $\Pi^0_1$-singleton$"$.

The left is to show $N\models$`` $x$ is not hyperarithmetic".

$\bf{Proof}$: Otherwise, there must be some nonstandard ordinal $\gamma_0$ in $N$ so that $N\models \emptyset^{\gamma_0} $ exists. We may assume that $\gamma_0<\alpha$. Since $\omega_1^x=\omega_1^{CK}$, there must be some (real) recursive ordinal $\gamma_1<\gamma_0$ so that $x^{\gamma_1}\geq_T \emptyset^{\gamma_0}$. Via some absoluteness, it is not difficult to see $\emptyset^{\gamma_0}\leq_T \emptyset^{\beta}$ for some $\beta<\alpha$. Then by the property of $x$, $\emptyset^{\gamma_0}<\emptyset^{\gamma_1}$.[]

喻 良
  • 4.2k
  • 1
  • 21
  • 30