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

Stob, Michael

Stob, Michael

J. Symbolic Logic, Tome 48 (1983) no. 1, p. 921-930 / Harvested from Project Euclid

Résumé

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 $\mathbf{a}$ with just one wtt-degree in $\mathbf{a}$ such that $\mathbf{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.

Publié le : 1983-12-14
Classification:

@article{1183741403,
     author = {Stob, Michael},
     title = {Wtt-Degrees and T-Degrees of R.E. Sets},
     journal = {J. Symbolic Logic},
     volume = {48},
     number = {1},
     year = {1983},
     pages = { 921-930},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741403}
}

Stob, Michael. Wtt-Degrees and T-Degrees of R.E. Sets. J. Symbolic Logic, Tome 48 (1983) no. 1, pp.  921-930. http://gdmltest.u-ga.fr/item/1183741403/