The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability
From MaRDI portal
Publication:4596355
DOI10.1090/tran/7187zbMath1445.03047OpenAlexW2750696211MaRDI QIDQ4596355
Theodore A. Slaman, Mariya Ivanova 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
rigidityTuring degreeautomorphism basebiinterpretabilityautomorphisms of Turing degrees\(\Delta^0_2\) degreearithmetically definable
Related Items
The enumeration degrees: Local and global structural interactions ⋮ The relationship between local and global structure in the enumeration degrees
Cites Work
- Definability in the Turing degrees
- First-order theory of the degrees of recursive unsolvability
- On the degrees less than 0'
- Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$
- Definability in the Recursively Enumerable Degrees
- Algorithmic Randomness and Complexity
- The Theory of the Degrees below 0 ′
- The enumeration degrees: Local and global structural interactions
This page was built for publication: The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability