Journal of Mathematical Logic · 2007 · 29 citations · 13 references
Natural SciencesComputer ScienceMathematicsCombinatoricsNumber TheoryTheory Of ComputationCombinatorial Number TheoryCombinatorial Set TheoryComputability TheoryComputational Complexity ClassesComputational Number TheoryEnumerative CombinatoricsEnumerability
We characterize the class of c.e. degrees that bound a critical triple (equivalently, a weak critical triple) as those degrees that compute a function that has no ω-c.e. approximation.
13
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
Klaus Ambos‐Spies, Carl G. Jockusch, Richard A. Shore et al. · Transactions of the American Mathematical Society · 1984 · 98 citations · Full text