Yinhe Peng

dblp:198/4644 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2024 A generalized Cantor Theorem in
abstract
Abstract It is proved in $\mathsf {ZF}$ (without the axiom of choice) that, for all infinite sets M, there are no surjections from $\omega \times M$ onto $\operatorname {\mathrm {\mathscr {P}}}(M)$ .
Yinhe Peng, Guozhen Shen
J. Symb. Log.1
2023 Some Consequences of and
abstract
Abstract Strong Turing Determinacy, or ${\mathrm {sTD}}$ , is the statement that for every 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 the following consequences of Turing Determinacy ( ${\mathrm {TD}}$ ) and ${\mathrm {sTD}}$ over ${\mathrm {ZF}}$ —the Zermelo–Fraenkel axiomatic set theory without the Axiom of Choice: (1) ${\mathrm {ZF}}+{\mathrm {TD}}$ implies $\mathrm {wDC}_{\mathbb {R}}$ —a weaker version of $\mathrm {DC}_{\mathbb {R}}$ . (2) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that every set of reals is measurable and has Baire property. (3) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that every uncountable set of reals has a perfect subset. (4) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that for every set of reals A and every $\epsilon>0$ : (a) There is a closed set $F\subseteq A$ such that $\mathrm {Dim_H}(F)\geq \mathrm {Dim_H}(A)-\epsilon $ , where $\mathrm {Dim_H}$ is the Hausdorff dimension. (b) There is a closed set $F\subseteq A$ such that $\mathrm {Dim_P}(F)\geq \mathrm {Dim_P}(A)-\epsilon $ , where $\mathrm {Dim_P}$ is the packing dimension.
Yinhe Peng, Liuzhen Wu, Liang Yu 0004
J. Symb. Log.1