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 ℰ, 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.
CITATION STYLE
Harrington, L., & Soare, R. I. (1991). Post’s program and incomplete recursively enumerable sets. Proceedings of the National Academy of Sciences of the United States of America, 88(22), 10242–10246. https://doi.org/10.1073/pnas.88.22.10242
Mendeley helps you to discover research relevant for your work.