A set of integers is computably encodable if every infinite set of integers has an infinite subset computing . By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this article, we extend this notion of computable encodability to subsets of the Baire space, and we characterize the -encodable compact sets as those which admit a nonempty -subset. Thanks to this equivalence, we prove that weak weak König’s lemma is not strongly computably reducible to Ramsey’s theorem. This answers a question of Hirschfeldt and Jockusch.
"-Encodability and Omniscient Reductions." Notre Dame J. Formal Logic 60 (1) 1 - 12, 2019. https://doi.org/10.1215/00294527-2018-0020