Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T15:46:44.044Z Has data issue: false hasContentIssue false

Generalized nonsplitting in the recursively enumerable degrees

Published online by Cambridge University Press:  12 March 2014

Steven D. Leonhardi*
Affiliation:
Winona State University, Department of Mathematics and Statistics, Winona, MN 55987, USA, E-mail: leonhardi@vax2.winona.msus.edu

Abstract

We investigate the algebraic structure of the upper semi-lattice formed by the recursively enumerable Turing degrees. The following strong generalization of Lachlan's Nonsplitting Theorem is proved: Given n ≥ 1, there exists an r.e. degree d such that the interval [d, 0′] ⊂ R admits an embedding of the n-atom Boolean algebra preserving (least and) greatest element, but also such that there is no (n + 1 )-tuple of pairwise incomparable r.e. degrees above d which pairwise join to 0′ (and hence, the interval [d, 0′] ⊂ R does not admit a greatest-element-preserving embedding of any lattice which has n + 1 co-atoms, including ). This theorem is the dual of a theorem of Ambos-Spies and Soare, and yields an alternative proof of their result that the theory of R has infinitely many one-types.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable