Transactions of the American Mathematical Society · 1982 · 21 citations · 13 references
Natural SciencesMathematicsAlgebraCombinatoricsTheory Of ComputationAlgebraic CombinatoricsCombinatorial EnumerationCombinatorial Set TheoryEnumerative CombinatoricsRecursion Theory
In this paper, we investigate the location of the branching degrees within the recursively enumerable (r.e.) degrees. We show that there is a branching degree below any given nonzero r.e. degree and, using a new branching degree construction and a technique of Robinson, that there is a branching degree above any given low r.e. degree. Our results extend work of Shoenfield and Soare and Lachlan on the generalized nondiamond question and show that the branching degrees form an automorphism base for the r.e. degrees.
13
T. G. McLaughlin, Gerald E. Sacks · American Mathematical Monthly · 1965 · 217 citations
A minimal pair of recursively enumerable degrees
C. E. M. Yates · Journal of Symbolic Logic · 1966 · 144 citations
R. L. Goodstein · Journal of the London Mathematical Society · 1964 · 136 citations