The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory (original) (raw)

1992, Theoretical Computer Science

Shore, R.A. and T.A. Slaman, The p-T degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory, Theoretical Computer Science 97 (1992) 2633284. Ambos-Spies (1984a) showed that the two basic nondistributive lattices can be embedded in R,.,, the polynomial-time Turing degrees of the recursive sets. We introduce more general techniques to extend his results to show that every recursive lattice can be embedded in R,,. In addition to lattice-theoretic representation theorems, we use the scheme of priority style arguments coupled with "looking back" techniques presented in Shinoda and Slaman (1988, 1990). We also generalize the density type results of Ladner (1975) and many others to settle the full extension of the embedding problem for R,.,. Combined with the logical analysis of sentences with one alternation of quantifiers (Shore 1978, Lerman 1983), these results suffice to decide the full U-theory of R,,. They also give a strong nonhomogeneity result: the p-time degrees of the sets recursive in (and, if desired, p-time above) two distinct sets A and E are almost never isomorphic. The situation for the p-time many-one degrees is quite different. We decide the extension of the embedding problem (differently than for R,,) but not the t/3-theory. A notion of reducibility 6, between sets is specified by giving a set of procedures for computing one set from another. We say that a set A is reducible to a set B, A <, B, if *Research partially supported by NSF Grants DMS-8601048 and DMS-8902797.