Turing cones and set theory of the reals (Q1407517)

The paper treats relations between various determinacy principles. Turing Determinacy is the statement that every Turing invariant set of reals is Martin measurable, which means that the set or its complement contains a Turing cone. (Here reals are elements of \(2^\omega\); a set of reals is said to be Turing invariant if it is closed under Turing equivalence; a Turing cone of a real \(x\) is defined to be the set of reals \(\{y: x\leq_T y\}\).) D.~A.~Martin showed that Turing Determinacy follows from Determinacy, by proving that every determined Turing invariant set is Martin measurable. The author considers the question whether Turing Determinacy follows from Blackwell Determinacy, a version of Determinacy using imperfect information games instead of the usual perfect information games, and shows that this implication cannot be proven in a similar manner: it is provable in ZFC+CH that there is a Blackwell determined Turing invariant set of reals which is not Martin measurable.