Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944)
Rogers, Hartley
J. Symbolic Logic, Tome 23 (1958) no. 1, p. 225-226 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1958-06-14
Classification:  
@article{1183733291,
     author = {Rogers, Hartley},
     title = {Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944)},
     journal = {J. Symbolic Logic},
     volume = {23},
     number = {1},
     year = {1958},
     pages = { 225-226},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183733291}
}

Rogers, Hartley. Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944). J. Symbolic Logic, Tome 23 (1958) no. 1, pp.  225-226. http://gdmltest.u-ga.fr/item/1183733291/