Review: S. B. Cooper, T. A. Slaman, S. S. Wainer, Computability, Enumerability, Unsolvability, Directions in Recursion Theory
Chong, C. T.
J. Symbolic Logic, Tome 64 (1999) no. 1, p. 1362-1365 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1999-09-14
Classification:  
@article{1183745888,
     author = {Chong, C. T.},
     title = {Review: S. B. Cooper, T. A. Slaman, S. S. Wainer, Computability, Enumerability, Unsolvability, Directions in Recursion Theory},
     journal = {J. Symbolic Logic},
     volume = {64},
     number = {1},
     year = {1999},
     pages = { 1362-1365},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745888}
}

Chong, C. T. Review: S. B. Cooper, T. A. Slaman, S. S. Wainer, Computability, Enumerability, Unsolvability, Directions in Recursion Theory. J. Symbolic Logic, Tome 64 (1999) no. 1, pp.  1362-1365. http://gdmltest.u-ga.fr/item/1183745888/