On a problem of Cooper and Epstein

Ishmukhametov, Shamil

J. Symbolic Logic, Tome 68 (2003) no. 1, p. 52-64 / Harvested from Project Euclid

Résumé

In “Bounding minimal degrees by computably enumerable degrees” by A. Li and D. Yang, (this Journal, \cite{LY}), the authors prove that there exist non-computable computably enumerable degrees c > a > z such that any minimal degree m being below c is also below a. We analyze the proof of their result and show that the proof contains a mistake. Instead we give a proof for the opposite result.

Publié le : 2003-03-14
Classification:

@article{1045861506,
     author = {Ishmukhametov, Shamil},
     title = {On a problem of Cooper and Epstein},
     journal = {J. Symbolic Logic},
     volume = {68},
     number = {1},
     year = {2003},
     pages = { 52-64},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1045861506}
}

Ishmukhametov, Shamil. On a problem of Cooper and Epstein. J. Symbolic Logic, Tome 68 (2003) no. 1, pp.  52-64. http://gdmltest.u-ga.fr/item/1045861506/