On The Computability of Perfect Subsets of Sets with Positive Measure
classification
🧮 math.LO
keywords
perfectmeasurepositivesetssubsetscomputabilitycomputationalconnect
read the original abstract
A set $X \subseteq 2^\omega$ 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.