Minimal pairs in initial segments of the recursively enumerable degrees
From MaRDI portal
Publication:1366939
DOI10.1007/BF02773633zbMath0924.03076MaRDI QIDQ1366939
Publication date: 8 November 1999
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
computably enumerable degrees; recursively enumerable degrees; initial segments; half of a minimal pair
03D25: Recursively (computably) enumerable sets and degrees
Related Items
On a problem of Cooper and Epstein, Classification of degree classes associated with r.e. subspaces, Splitting theorems in recursion theory, There is no plus-capping degree, Nonbounding and Slaman triples, There is no fat orbit, On self-embeddings of computable linear orderings
Cites Work
- Unnamed Item
- Three theorems on the degrees of recursively enumerable sets
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- On Pairs of Recursively Enumerable Degrees
- Splitting properties of r.e. sets and degrees
- Localization of a theorem of Ambos-Spies and the strong anti-splitting property
- Bounding minimal pairs
- Minimal pairs and high recursively enumerable degrees
- Degrees of classes of RE sets
- Lower Bounds for Pairs of Recursively Enumerable Degrees