Liang Yu

collaborators

3 papers

math.LO2020

TD implies CCR

Yinhe Peng, Liang Yu

Assuming $ZF$ , we prove that Turing determinacy ( $TD$ ) implies countable choice axiom for sets of reals ( $CCR$ ).

math.LO2020

Luzin's (N) and randomness reflection

Arno Pauly, Linda Westrick, Liang Yu

We show that a computable function $f : R \to R$ has Luzin's property (N) if and only if it reflects $Π_{1}^{1}$ -randomnes, if and only if it reflects $Δ^1_1(\mathc…

math.LO2018

A model with everything except for a well-ordering of the reals

Jörg Brendle, Fabiana Castiblanco, Ralf Schindler +2

We construct a model of $ZF + DC$ containing a Luzin set, a Sierpiński set, as well as a Burstin basis but in which there is no a well ordering of the continuum.