SOME CONSEQUENCES OF AND
From MaRDI portal
Publication:6140185
DOI10.1017/JSL.2023.29arXiv2107.10470MaRDI QIDQ6140185FDOQ6140185
Authors: Yinhe Peng, Liuzhen Wu, Liang Yu
Publication date: 22 December 2023
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Abstract: Strongly Turing determinacy, or , says that for any set of reals, if , then there is a pointed set . We prove the following consequences of Turing determinacy () and : (1). implies weakly dependent choice (). (2). implies that every set of reals is measurable and has Baire property. (3). implies that every uncountable set of reals has a perfect subset. (4). implies that for any set of reals and any , (a) there is a closed set so that . (b) there is a closed set so that .
Full work available at URL: https://arxiv.org/abs/2107.10470
Fractals (28A80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Other combinatorial set theory (03E05) Descriptive set theory (03E15) Axiom of choice and related propositions (03E25) Determinacy principles (03E60)
Cites Work
- Fractal geometry. Mathematical foundations and applications
- Algorithmic randomness and complexity.
- Computability and randomness
- On the existence of subsets of finite positive packing measure
- Computational randomness and lowness
- The axiom of determinateness and reduction principles in the analytical hierarchy
- A perfect set of reals with finite self-information
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong and weak duality principles for fractal dimension in Euclidean space
- A five element basis for the uncountable linear orders
- On the axiom of determinateness
- Set theory. Exploring independence and truth
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory
- The axiom of determinacy implies dependent choices in L(R)
- Recursion theory. Computational aspects of definability
- Turing determinacy and the continuum hypothesis
- Turing Determinacy and Suslin sets
- Hausdorff dimension regularity properties and games
- Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
- Lowness for effective Hausdorff dimension
- Capacitability for Co-Analytic Sets
- Turing invariant sets and the perfect set property
This page was built for publication: SOME CONSEQUENCES OF AND
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140185)