Some consequences of TD and sTD
Abstract
Strongly Turing determinacy, or sTD, says that for any set A of reals, if ∀ x∃ y≥T x (y∈ A), then there is a pointed set P⊂eq A. We prove the following consequences of Turing determinacy (TD) and sTD: (1). ZF+TD implies weakly dependent choice (wDC). (2). ZF+sTD implies that every set of reals is measurable and has Baire property. (3). ZF+sTD implies that every uncountable set of reals has a perfect subset. (4). ZF+sTD implies that for any set of reals A and any ε>0, (a) there is a closed set F⊂eq A so that DimH(F)≥ DimH(A)-ε. (b) there is a closed set F⊂eq A so that DimP(F)≥ DimP(A)-ε.
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.