Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets
Lachlan, A. H.
J. Symbolic Logic, Tome 33 (1968) no. 1, p. 431-443 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1968-09-14
Classification:  
@article{1183736430,
     author = {Lachlan, A. H.},
     title = {Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets},
     journal = {J. Symbolic Logic},
     volume = {33},
     number = {1},
     year = {1968},
     pages = { 431-443},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183736430}
}

Lachlan, A. H. Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets. J. Symbolic Logic, Tome 33 (1968) no. 1, pp.  431-443. http://gdmltest.u-ga.fr/item/1183736430/