Fragments of the theory of the enumeration degrees

DOI10.1016/J.AIM.2021.107686MaRDI QIDQ2020402zbMATH OpenOpenAlexFDO

Authors Steffen Lempp, Theodore A. Slaman, Mariya I. 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

decidabilityenumeration degreesextension of embeddings problemfragments of theory

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Embedding distributive lattices in the \(\Sigma ^0_2\) enumeration degrees
• scientific article; zbMATH DE number 1531929
• Diamond embeddings into the enumeration degrees
• Embedding finite lattices into the Σ₂⁰ enumeration degrees
• scientific article; zbMATH DE number 3939344

Cites work

• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• A note on initial segments of the enumeration degrees
• Arithmetical Reducibilities I
• Decidability and Invariant Classes for Degree Structures
• Definability in the enumeration degrees
• Empty intervals in the enumeration degrees
• Extension of embeddings in the computably enumerable degrees
• First-order theory of the degrees of recursive unsolvability
• Initial segments of the degrees of unsolvability
• ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
• Reducibility and Completeness for Sets of Integers
• Reducibility orderings: Theories, definability and automorphisms
• Several results on upper semilattices and m-degrees
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• The Theory of the Degrees below 0 ′
• The Π₂⁰ enumeration degrees are not dense
• The Π₃-theory of the -enumeration degrees is undecidable
• Undecidable fragments of elementary theories

Cited in

(3)

• Toward a Theory of Enumerations
• Strong minimal pairs in the enumeration degrees
• Extensions of two constructions of Ahmad

This page was built for publication: Fragments of the theory of the enumeration degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020402)