Definability in the Recursively Enumerable Degrees
Nies, André ; Shore, Richard A. ; Slaman, Theodore A.
Bull. Symbolic Logic, Tome 2 (1996) no. 1, p. 392-404 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1996-12-14
Classification:  
@article{1182353470,
     author = {Nies, Andr\'e and Shore, Richard A. and Slaman, Theodore A.},
     title = {Definability in the Recursively Enumerable Degrees},
     journal = {Bull. Symbolic Logic},
     volume = {2},
     number = {1},
     year = {1996},
     pages = { 392-404},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1182353470}
}

Nies, André; Shore, Richard A.; Slaman, Theodore A. Definability in the Recursively Enumerable Degrees. Bull. Symbolic Logic, Tome 2 (1996) no. 1, pp.  392-404. http://gdmltest.u-ga.fr/item/1182353470/