Fragments of the theory of the enumeration degrees

DOI10.1016/j.aim.2021.107686MaRDI QIDQ2020402

Theodore A. Slaman, Steffen Lempp, Mariya Ivanova Soskova

Publication date: 23 April 2021

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2021.107686

zbMATH Keywords

decidability; enumeration degrees; extension of embeddings problem; fragments of theory

Mathematics Subject Classification ID

03D30: Other degrees and reducibilities in computability and recursion theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Empty intervals in the enumeration degrees
• Several results on upper semilattices and m-degrees
• First-order theory of the degrees of recursive unsolvability
• Definability in the enumeration degrees
• Undecidable fragments of elementary theories
• Initial segments of the degrees of unsolvability
• A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
• The Π₂⁰ enumeration degrees are not dense
• ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
• The Π₃-theory of the -enumeration degrees is undecidable
• Decidability and Invariant Classes for Degree Structures
• Reducibility and Completeness for Sets of Integers
• The Theory of the Degrees below 0 ′
• Reducibility orderings: Theories, definability and automorphisms
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• Arithmetical Reducibilities I
• Extension of embeddings in the computably enumerable degrees