I posted a question on MathOverflow about understanding Kleene's construction of a computable tree with an infinite branch but no infinite hyperarithmetical branch: mathoverflow.net/q/513712/17064
Unwrapping the proof of the fact that an infinite branch of a computable tree can fail to be hyperarithmetical
(Experts can skip the following two paragraphs, which are written for the sake of completeness of MathOverflow.) Standard definitions (recalled for convenience): In this question, a tree means a su...
mathoverflow.net