The enumeration degrees: Local and global structural interactions

DOI10.1090/conm/690/13862zbMath1420.03097OpenAlexW4242825860MaRDI QIDQ5351849

Theodore A. Slaman, Mariya Ivanova Soskova

Publication date: 30 August 2017

Published in: Foundations of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/690/13862

zbMATH Keywords

rigidityenumeration degreesautomorphism base

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items

The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability ⋮ The relationship between local and global structure in the enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability in the Turing degrees
• First-order theory of the degrees of recursive unsolvability
• Definability in the enumeration degrees
• On degrees of unsolvability
• The automorphism group of the enumeration degrees
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Jumps of quasi-minimal enumeration degrees
• Reducibility and Completeness for Sets of Integers
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability
• On minimal pairs of enumeration degrees
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• Cupping and definability in the local structure of the enumeration degrees
• Degrees of Unsolvability. (AM-55)
• Arithmetical Reducibilities I
• Defining totality in the enumeration degrees

This page was built for publication: The enumeration degrees: Local and global structural interactions