It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite lowâ‚‚ homogeneous set H. We answer a question of the same ...
This is a preview. Log in through your library . Abstract The classical Halpern–Läuchli theorem states that for any finite coloring of a finite product of finitely branching perfect trees of height ω, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback