Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics

Journal of Mathematical Logic 24 (2) (2023)
  Copy   BIBTEX

Abstract

For [Formula: see text], the coarse similarity class of A, denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of A and B has asymptotic density 0. There is a natural metric [Formula: see text] on the space [Formula: see text] of coarse similarity classes defined by letting [Formula: see text] be the upper density of the symmetric difference of A and B. We study the metric space of coarse similarity classes under this metric, and show in particular that between any two distinct points in this space there are continuum many geodesic paths. We also study subspaces of the form [Formula: see text] where [Formula: see text] is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of [Formula: see text]. We then define a distance between Turing degrees based on Hausdorff distance in the metric space [Formula: see text]. We adapt a proof of Monin to show that the Hausdorff distances between Turing degrees that occur are exactly 0, [Formula: see text], and 1, and study which of these values occur most frequently in the senses of Lebesgue measure and Baire category. We define a degree a to be attractive if the class of all degrees at distance [Formula: see text] from a has measure 1, and dispersive otherwise. In particular, we study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition for embeddability. Motivated by a couple of issues arising in the above work, we also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually 1-random, as well as a perfect set whose elements are mutually 1-generic. Finally, we study the completeness of [Formula: see text] from the perspectives of computability theory and reverse mathematics.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Mass problems and hyperarithmeticity.Joshua A. Cole & Stephen G. Simpson - 2007 - Journal of Mathematical Logic 7 (2):125-143.
Bounds on Scott ranks of some polish metric spaces.William Chan - 2020 - Journal of Mathematical Logic 21 (1):2150001.
Degrees of categoricity and treeable degrees.Barbara F. Csima & Dino Rossegger - forthcoming - Journal of Mathematical Logic.
Direct and local definitions of the Turing jump.Richard A. Shore - 2007 - Journal of Mathematical Logic 7 (2):229-262.
Turing independence and Baire category.Ashutosh Kumar & Saharon Shelah - forthcoming - Journal of Mathematical Logic.
Reverse mathematics of mf spaces.Carl Mummert - 2006 - Journal of Mathematical Logic 6 (2):203-232.

Analytics

Added to PP
2023-02-26

Downloads
6 (#1,485,580)

6 months
4 (#862,833)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Lowness for genericity.Liang Yu - 2006 - Archive for Mathematical Logic 45 (2):233-238.
WKL 0 and induction principles in model theory.David R. Belanger - 2015 - Annals of Pure and Applied Logic 166 (7-8):767-799.

View all 18 references / Add more references