Published online by Cambridge University Press: 12 March 2014
Certain investigations have been made concerning the nature of classes of recursively enumerable sets, and the relation of such classes to the recursively enumerable indices of their sets. For instance, a theorem of Rice [3, Theorem XIV(a), p. 324] states that if A is the complete set of indices for a class of recursively enumerable sets (that is, if there is a class of recursively enumerable sets such that and if A is recursive, then either A = ⌀ or A = ω. A relate theorem by Rice and Shapiro [3, Theorem XIV(b), p. 324] can be stated as follows:
Let be a class of recursively enumerable sets, and let A be the complete set of indices for . Then A is r.e. if and only if there is an r.e. set D of canonical indices of finite sets Du, u ∈ D, such that
A somewhat similar theorem of Yates is the following: Let be a class of recursively enumerable sets which contains all finite sets. Let A be the complete set of indices for . Then there is a uniform recursive enumeration of the sets in if and only if A is recursively enumerable in 0(2)—that is, if and only if A is Σ3. A corollary of this is that if C is any r.e. set such that C(2)≡T⌀(2), there is a uniform recursive enumeration of all sets We such that We ≤TC [9, Theorem 9, p. 265].
The results in this paper are taken from the author's Ph.D. thesis, which was written at the University of Illinois at Urbana-Champaign under the guidance of Professor Carl G. Jockusch. The paper was written at Western Illinois University.
I would like to thank the referee for several valuable suggestions.