Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms

Archive for Mathematical Logic 62 (5):843-869 (2023)
  Copy   BIBTEX

Abstract

In the first half of this paper, we study the way that sets of real numbers closed under Turing equivalence sit inside the real line from the perspective of algebra, measure and orders. Afterwards, we combine the results from our study of these sets as orders with a classical construction from Avraham to obtain a restriction about how non trivial automorphism of the Turing degrees (if they exist) interact with 1-generic degrees.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,551

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

Lowness for genericity.Liang Yu - 2006 - Archive for Mathematical Logic 45 (2):233-238.
Topological aspects of the Medvedev lattice.Andrew Em Lewis, Richard A. Shore & Andrea Sorbi - 2011 - Archive for Mathematical Logic 50 (3-4):319-340.
On computable numberings of families of Turing degrees.Marat Faizrahmanov - 2024 - Archive for Mathematical Logic 63 (5):609-622.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Degree spectra of real closed fields.Russell Miller & Victor Ocasio González - 2019 - Archive for Mathematical Logic 58 (3-4):387-411.

Analytics

Added to PP
2023-02-17

Downloads
18 (#1,116,505)

6 months
8 (#594,873)

Historical graph of downloads
How can I increase my downloads?