The computably enumerable degrees are locally non-cappable (Q1879005): Difference between revisions

The bulk of this paper is devoted to a proof that every non-computable incomplete computably enumerable degree is locally non-cappable. Seetapun proved this in his thesis, but the new proof given here is a priority argument patterned after \textit{R. Soare}'s link/list proof of the Lachlan non-bounding theorem [Recursively enumerable sets and degrees, Berlin: Springer-Verlag (1987; Zbl 0667.03030)]. An immediate corollary is that there is no maximal non-bounding computably enumerable degree.