Yinhe Peng

activity

20202022

collaborators

3 papers

math.LO2022

MA $_{ω_{1}} (S) [S]$ does not imply $K_{2}$

Yinhe Peng, Liuzhen Wu

We construct a model in which MA $_{ω_{1}}$ (S)[S] holds and $K_{2}$ fails. This shows that MA $_{ω_{1}}$ (S)[S] does not imply $K_{2}$ and answers an old question of Larso…

math.LO2021

Some consequences of $TD$ and $sTD$

Yinhe Peng, Liuzhen Wu, Liang Yu

Strongly Turing determinacy, or $sTD$ , says that for any set $A$ of reals, if $\forall x \exists y \geq_{T} x (y \in A)$ , then there is a pointed set $P \subseteq A$ . We prove t…

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$ ).

MAω1​​(S)[S] does not imply K2​

Some consequences of TD and sTD

TD implies CCR

MA $_{ω_{1}} (S) [S]$ does not imply $K_{2}$

Some consequences of $TD$ and $sTD$