On the computability of perfect subsets of sets with positive measure

DOI10.1090/PROC/14413MaRDI QIDQ5233979zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 9 September 2019

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.06082

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Algorithmic randomness and dimension (03D32) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Constructive and recursive analysis (03F60)

Abstract: A set $Xsubseteq{2}^{o}mega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of perfect subsets of sets with positive measure with reverse mathematics.

Recommendations

• A strong law of computationally weak subsets
• On effectively closed sets of effective strong measure zero
• Infinite subsets of random sets of integers
• The strength of measurability hypotheses
• Limit computability and constructive measure

Cites work

• \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
• Algorithmic randomness and complexity.
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• scientific article; zbMATH DE number 4008384 (Why is no real title available?)
• On the strength of Ramsey's theorem for trees
• Reverse mathematics and Ramsey's property for trees
• Subsystems of second order arithmetic

Cited in

(9)

• N. N. Luzin's problems on the existence of CA-sets without perfect subsets
• Highness properties close to PA completeness
• Perfect subsets of invariant CA-sets
• On effectively closed sets of effective strong measure zero
• A strong law of computationally weak subsets
• Measure-theoretic uniformity and the Suslin functional
• Where pigeonhole principles meet Koenig lemmas
• Growth and irreducibility in path-incompressible trees
• Pathwise-randomness and models of second-order arithmetic

This page was built for publication: On the computability of perfect subsets of sets with positive measure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233979)