Document Type


Publication Title

Annals of Pure and Applied Logic


A splitting of an r.e. set A is a pair A1, A2 of disjoint r.e. sets such that A1 ∪ A2 = A. Theorems about splittings have played an important role in recursion theory. One of the main reasons for this is that a splitting of A is a decomposition of A in both the lattice, ε, of recursively enumerable sets and in the uppersemilattice, R, of recursively enumerable degrees (since A1 ≤T A, A2 ≤T A and A ≤T A1 ⊕ A2). Thus splitting theor ems have been used to obtain results about the structure of ε, the structure of R, and the relationship between the two structures. Furthermore it is fair to say that questions about splittings have often generated important new technical developments in recursion theory. In this article we survey most of the results and techniques associated with splitting properties of r.e. sets in ordinary recursion theory.

First Page


Last Page




Publication Date




To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.