Skip to main content
Log in

On the distribution of Lachlan nonsplitting bases

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

 We say that a computably enumerable (c.e.) degree b is a Lachlan nonsplitting base (LNB), if there is a computably enumerable degree a such that a > b, and for any c.e. degrees w,v ≤ a, if a ≤ w or; v or; b then either a ≤ w or; b or a ≤ v or; b. In this paper we investigate the relationship between bounding and nonbounding of Lachlan nonsplitting bases and the high /low hierarchy. We prove that there is a non-Low2 c.e. degree which bounds no Lachlan nonsplitting base.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 11 October 1999 / Published online: 7 May 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cooper, S., Li, A. & Yi, X. On the distribution of Lachlan nonsplitting bases. Arch. Math. Logic 41, 455–482 (2002). https://doi.org/10.1007/s001530100095

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530100095

Keywords

Navigation