The ^0_2 Turing degrees: automorphisms and definability

DOI10.1090/TRAN/7187MaRDI QIDQ4596355zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

rigidityTuring degreeautomorphism basebiinterpretabilityautomorphisms of Turing degrees\(\Delta^0_2\) degreearithmetically definable

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• scientific article; zbMATH DE number 66485
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• Definability in the Turing degrees
• Local Initial Segments of The Turing Degrees
• scientific article; zbMATH DE number 1390015

Cites work

• Algorithmic randomness and complexity.
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• Definability in the Recursively Enumerable Degrees
• Definability in the Turing degrees
• First-order theory of the degrees of recursive unsolvability
• On the degrees less than 0'
• The Theory of the Degrees below 0 ′
• The enumeration degrees: local and global structural interactions

Cited in

(13)

• The relationship between local and global structure in the enumeration degrees
• Permutations of the integers induce only the trivial automorphism of the Turing degrees
• scientific article; zbMATH DE number 1390084 (Why is no real title available?)
• Local Initial Segments of The Turing Degrees
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• scientific article; zbMATH DE number 66485 (Why is no real title available?)
• Automorphisms of the truth-table degrees are fixed on a cone
• scientific article; zbMATH DE number 1795232 (Why is no real title available?)
• The automorphism group of the enumeration degrees
• Every \({\Delta}^0_2\)-set is natural, up to Turing equivalence
• The enumeration degrees: local and global structural interactions
• Permutations of the integers induce only the trivial automorphism of the Turing degrees
• Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond

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)