The ^0_2 Turing degrees: automorphisms and definability
From MaRDI portal
Publication:4596355
DOI10.1090/TRAN/7187zbMATH Open1445.03047OpenAlexW2750696211MaRDI QIDQ4596355FDOQ4596355
Authors: Theodore A. Slaman, Mariya I. Soskova
Publication date: 1 December 2017
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/tran/7187
Recommendations
rigidityTuring degreeautomorphism basebiinterpretabilityautomorphisms of Turing degrees\(\Delta^0_2\) degreearithmetically definable
Cites Work
- Algorithmic randomness and complexity.
- First-order theory of the degrees of recursive unsolvability
- On the degrees less than 0'
- The Theory of the Degrees below 0 ′
- Definability in the Turing degrees
- Definability in the Recursively Enumerable Degrees
- Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
- The enumeration degrees: local and global structural interactions
Cited In (13)
- The relationship between local and global structure in the enumeration degrees
- Every \({\Delta}^0_2\)-set is natural, up to Turing equivalence
- Permutations of the integers induce only the trivial automorphism of the Turing degrees
- Permutations of the integers induce only the trivial automorphism of the Turing degrees
- The automorphism group of the enumeration degrees
- The enumeration degrees: local and global structural interactions
- Local Initial Segments of The Turing Degrees
- Title not available (Why is that?)
- Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond
- Title not available (Why is that?)
- Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
- Title not available (Why is that?)
- Automorphisms of the truth-table degrees are fixed on a cone
This page was built for publication: The \(\Delta ^0_2\) Turing degrees: automorphisms and definability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596355)