Working Below a High Recursively Enumerable Degree
Shore, Richard A. ; Slaman, Theodore A.
J. Symbolic Logic, Tome 58 (1993) no. 1, p. 824-859 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1993-09-14
Classification:  
@article{1183744300,
     author = {Shore, Richard A. and Slaman, Theodore A.},
     title = {Working Below a High Recursively Enumerable Degree},
     journal = {J. Symbolic Logic},
     volume = {58},
     number = {1},
     year = {1993},
     pages = { 824-859},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183744300}
}

Shore, Richard A.; Slaman, Theodore A. Working Below a High Recursively Enumerable Degree. J. Symbolic Logic, Tome 58 (1993) no. 1, pp.  824-859. http://gdmltest.u-ga.fr/item/1183744300/