Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

On a conjecture of Lempp

  • 21 Accesses

  • 2 Citations

Abstract.

In this paper, we first prove that there exist computably enumerable (c.e.) degrees a and b such that \({\bf a\not\leq b}\), and for any c.e. degree u, if \({\bf u\leq a}\) and u is cappable, then \({\bf u\leq b}\), so refuting a conjecture of Lempp (in Slaman [1996]); secondly, we prove that: (A. Li and D. Wang) there is no uniform construction to build nonzero cappable degree below a nonzero c.e. degree, that is, there is no computable function \(f\) such that for all \(e\in\omega,\) (i) \(W_{f(e)}\leq_{\rm T}W_e\), (ii) \(W_{f(e)}\) has a cappable degree, and (iii) \(W_{f(e)}\not\leq_{\rm T}\emptyset\) unless \(W_e\leq_{\rm T}\emptyset.\)

This is a preview of subscription content, log in to check access.

Author information

Additional information

Received: 19 Otober 1998

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Li, A. On a conjecture of Lempp. Arch Math Logic 39, 281–309 (2000). https://doi.org/10.1007/s001530050148

Download citation

Keywords

  • Computable Function
  • Uniform Construction
  • Cappable Degree