On the computability of perfect subsets of sets with positive measure

DOI10.1090/PROC/14413zbMath1484.03077arXiv1808.06082OpenAlexW2886976448WikidataQ128137129 ScholiaQ128137129MaRDI QIDQ5233979

No author found.

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

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

Related Items (3)

Growth and irreducibility in path-incompressible trees ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ Highness properties close to PA completeness

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• On the strength of Ramsey's theorem for trees
• RT₂² does not imply WKL₀
• Algorithmic Randomness and Complexity
• Reverse mathematics and Ramsey's property for trees

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