Abstract.
It will be shown that there exist computably enumerable degrees a and b such that a \(>\) b, and for any computably enumerable degree u, if u \(\leq\) a and u is cappable, then u \(<\) b.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 22 April 1997
Rights and permissions
About this article
Cite this article
Li, A. Bounding cappable degrees. Arch Math Logic 39, 311–352 (2000). https://doi.org/10.1007/s001530050152
Issue Date:
DOI: https://doi.org/10.1007/s001530050152