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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 11 October 1999 / Published online: 7 May 2002
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s001530100095