Recursively enumerable sets which are uniform for finite extensions
Donald A. Alton · Journal of Symbolic Logic · 1971
Let W0, W1 … be one of the usual enumerations of recursively enumerable (r.e.) subsets of the set N of nonnegative integers. (Background information will be given later.) Suggestions of Anil Nerode led to the following Definitions. Let B be a subset of N and let ψ be a partial recursive function.