A Minimal Pair of Recursively Enumerable Degrees
Yates, C. E. M.
J. Symbolic Logic, Tome 31 (1966) no. 1, p. 159-168 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1966-06-14
Classification:  
@article{1183735415,
     author = {Yates, C. E. M.},
     title = {A Minimal Pair of Recursively Enumerable Degrees},
     journal = {J. Symbolic Logic},
     volume = {31},
     number = {1},
     year = {1966},
     pages = { 159-168},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183735415}
}

Yates, C. E. M. A Minimal Pair of Recursively Enumerable Degrees. J. Symbolic Logic, Tome 31 (1966) no. 1, pp.  159-168. http://gdmltest.u-ga.fr/item/1183735415/