Minimal pairs in initial segments of the recursively enumerable degrees

DOI10.1007/BF02773633zbMath0924.03076MaRDI QIDQ1366939

Bernhard Rupp

Publication date: 8 November 1999

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

computably enumerable degreesrecursively enumerable degreesinitial segmentshalf of a minimal pair

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (9)

Classification of degree classes associated with r.e. subspaces ⋮ Splitting into degrees with low computational strength ⋮ Nonbounding and Slaman triples ⋮ There is no fat orbit ⋮ On a problem of Cooper and Epstein ⋮ On self-embeddings of computable linear orderings ⋮ Splitting theorems in recursion theory ⋮ Integer valued betting strategies and Turing degrees ⋮ There is no plus-capping degree

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

This page was built for publication: Minimal pairs in initial segments of the recursively enumerable degrees