Abstract
A set A of nonnegative integers is recursively enumerable (r.e.) if A can be computably listed. It is shown that there is a first-order property, Q(X), definable in E, the lattice of r.e. sets under inclusion, such that (i) if A is any r.e. set satisfying Q(A) then A is nonrecursive and Turing incomplete and (ii) there exists an r.e. set A satisfying Q(A). This resolves a long open question stemming from Post's program of 1944, and it sheds light on the fundamental problem of the relationship between the algebraic structure of an r.e. set A and the (Turing) degree of information that A encodes.
Full text
PDF
Selected References
These references are in PubMed. This may not be the complete list of references from this article.
- Friedberg R. M. TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944). Proc Natl Acad Sci U S A. 1957 Feb 15;43(2):236–238. doi: 10.1073/pnas.43.2.236. [DOI] [PMC free article] [PubMed] [Google Scholar]