Yinhe Peng

activity

20202022

most citedA generalized Cantor theorem in ZF

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 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.GN2022

L vector spaces and L fields

Yinhe Peng, Liuzhen Wu

We construct in ZFC an L topological vector space -- a topological vector space that is an L space -- and an L field -- a topological field that is an L space. This generalizes res…

math.LO2022

A surjection from square onto power

Yinhe Peng, Guozhen Shen, Liuzhen Wu

It is shown that the existence of an infinite set $A$ such that $A^{2}$ maps onto $2^{A}$ is consistent with $ZF$ .

math.LO2021★ 1 cited

A generalized Cantor theorem in ZF

Yinhe Peng, Guozhen Shen

It is proved in $ZF$ (without the axiom of choice) that, for all infinite sets $M$ , there are no surjections from $ω \times M$ onto $P (M)$ .

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​