Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Wtt-Degrees and T-Degrees of R.E. Sets

Michael Stob
The Journal of Symbolic Logic
Vol. 48, No. 4 (Dec., 1983), pp. 921-930
DOI: 10.2307/2273658
Stable URL: http://www.jstor.org/stable/2273658
Page Count: 10
  • Get Access
  • Read Online (Free)
  • Download ($10.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Wtt-Degrees and T-Degrees of R.E. Sets
Preview not available

Abstract

We use some simple facts about the wtt-degrees of r.e. sets together with a construction to answer some questions concerning the join and meet operators in the r.e. degrees. The construction is that of an r.e. Turing degree a with just one wtt-degree in a such that a is the join of a minimal pair of r.e. degrees. We hope to illustrate the usefulness of studying the stronger reducibility orderings of r.e. sets for providing information about Turing reducibility.

Page Thumbnails

  • Thumbnail: Page 
921
    921
  • Thumbnail: Page 
922
    922
  • Thumbnail: Page 
923
    923
  • Thumbnail: Page 
924
    924
  • Thumbnail: Page 
925
    925
  • Thumbnail: Page 
926
    926
  • Thumbnail: Page 
927
    927
  • Thumbnail: Page 
928
    928
  • Thumbnail: Page 
929
    929
  • Thumbnail: Page 
930
    930