Extension of embeddings in the computably enumerable degrees
From MaRDI portal
Publication:5945541
DOI10.2307/3062109zbMath0988.03063MaRDI QIDQ5945541
Theodore A. Slaman, Robert I. Soare
Publication date: 14 February 2002
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3062109
03D25: Recursively (computably) enumerable sets and degrees
Related Items
A GAP Package for Braid Orbit Computation and Applications, The ∀∃-theory of ℛ(≤,∨,∧) is undecidable, On the existence of a strong minimal pair, Almost universal cupping and diamond embeddings, Model-theoretic properties of Turing degrees in the Ershov difference hierarchy, Structural theory of degrees of unsolvability: advances and open problems, Fragments of the theory of the enumeration degrees, Turing computability: structural theory, The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable, Extensions of embeddings below computably enumerable degrees, Degree Structures: Local and Global Investigations, The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable