Applying Generic Coding with Help to Uniformizations

This is a follow up to a paper by the author where the disjointness relation for (the graphs of) definable functions from ${^ωω}$ to ${^ωω}$ is analyzed. In that paper, for each $a \in {^ωω}$ we defined a Baire class one function $f_a^{GC} : {^ωω} \to {^ωω}$ which encoded $a$ in a certain sense. Given $g : {^ωω} \to {^ωω}$, let $Ψ(g)$ be the statement that $g$ is disjoint from at most countably many of the functions $f_a^{GC}$. We show the consistency strength of $(\forall g)\, Ψ(g)$ is at most one inaccessible cardinal. We show that $\mbox{AD}^+$ implies $(\forall g)\, Ψ(g)$. Finally, we show that assuming large cardinals, $(\forall g)\, Ψ(g)$ holds in models of the form $L(\mathbb{R} [\mathcal{U}]$ where $\mathcal{U}$ is a selective ultrafilter on $ω$.

No reviews yet.

No comments yet.