Cone avoiding closed sets

Abstract

We prove that for an arbitrary subtree T of 2<ω with each element extendable to a path, a given countable class M closed under disjoint union, and any set A, if none of the members of M strongly k-enumerate T for any k, then there exists an infinite set contained in either A or A such that for every C∈M, C G also does not strongly k-enumerate T. We give applications of this result, which include: (1) RT22 doesn't imply WWKL0; (2) (Ambos-Spies et al.2004) DNR is strictly weaker than WWKL0; (3) (Kjos-Hanssen 2009) for any Martin-L\"of random set A either A or A contains an infinite subset that does not compute any Martin-L\"of random set; etc. We also discuss further generalizations of this result.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…