Fragments of the theory of the enumeration degrees
From MaRDI portal
Publication:2020402
DOI10.1016/J.AIM.2021.107686OpenAlexW3138894201MaRDI QIDQ2020402FDOQ2020402
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on initial segments of the enumeration degrees
- Title not available (Why is that?)
- First-order theory of the degrees of recursive unsolvability
- Initial segments of the degrees of unsolvability
- The Π20 enumeration degrees are not dense
- Reducibility and Completeness for Sets of Integers
- The Theory of the Degrees below 0 ′
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
- Extension of embeddings in the computably enumerable degrees
- Arithmetical Reducibilities I
- Definability in the enumeration degrees
- Reducibility orderings: Theories, definability and automorphisms
- The Π3-theory of the -enumeration degrees is undecidable
- Several results on upper semilattices and m-degrees
- Undecidable fragments of elementary theories
- Empty intervals in the enumeration degrees
- Decidability and Invariant Classes for Degree Structures
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
Cited In (3)
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)