On a Class of Complete Simple Sets
Canadian mathematical bulletin, Tome 8 (1965) no. 1, pp. 33-37

Voir la notice de l'article provenant de la source Cambridge

DOI

Since the solution of Post' s Problem by Friedberg and Muchnik, a good deal of abstract knowledge about the semilattice of recursively enumerable degrees has been developed, especially in recent papers of G. E. Sacks. In this note, we show that one specific class of simple sets contains only sets of degree 0'; no contribution to the general theory is claimed. One of the sets belonging to the special class considered is the original simpie-but-not-hypersimple S of Post [1]. According to information received from Sacks, J. R. Myhill gave a proof, in 1953, of the completeness of S. However, as far as we know, Myhill' s proof (presented in a seminar) does not exist in published form.
McLaughlin, T. G. On a Class of Complete Simple Sets. Canadian mathematical bulletin, Tome 8 (1965) no. 1, pp. 33-37. doi: 10.4153/CMB-1965-006-2
@article{10_4153_CMB_1965_006_2,
     author = {McLaughlin, T. G.},
     title = {On a {Class} of {Complete} {Simple} {Sets}},
     journal = {Canadian mathematical bulletin},
     pages = {33--37},
     year = {1965},
     volume = {8},
     number = {1},
     doi = {10.4153/CMB-1965-006-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-006-2/}
}
TY  - JOUR
AU  - McLaughlin, T. G.
TI  - On a Class of Complete Simple Sets
JO  - Canadian mathematical bulletin
PY  - 1965
SP  - 33
EP  - 37
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-006-2/
DO  - 10.4153/CMB-1965-006-2
ID  - 10_4153_CMB_1965_006_2
ER  - 
%0 Journal Article
%A McLaughlin, T. G.
%T On a Class of Complete Simple Sets
%J Canadian mathematical bulletin
%D 1965
%P 33-37
%V 8
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-006-2/
%R 10.4153/CMB-1965-006-2
%F 10_4153_CMB_1965_006_2

Cité par Sources :