no. 1
Complete index sets of recursively enumerable families
Compositio Mathematica, Tome 24 (1972) no. 1, pp. 83-91. 
@article{CM_1972__24_1_83_0,
     author = {McLaughlin, T. G.},
     title = {Complete index sets of recursively enumerable families},
     journal = {Compositio Mathematica},
     pages = {83--91},
     publisher = {Wolters-Noordhoff Publishing},
     volume = {24},
     number = {1},
     year = {1972},
     mrnumber = {311466},
     zbl = {0306.02040},
     language = {en},
     url = {http://archive.numdam.org/item/CM_1972__24_1_83_0/}
}
TY  - JOUR
AU  - McLaughlin, T. G.
TI  - Complete index sets of recursively enumerable families
JO  - Compositio Mathematica
PY  - 1972
SP  - 83
EP  - 91
VL  - 24
IS  - 1
PB  - Wolters-Noordhoff Publishing
UR  - http://archive.numdam.org/item/CM_1972__24_1_83_0/
LA  - en
ID  - CM_1972__24_1_83_0
ER  - 
%0 Journal Article
%A McLaughlin, T. G.
%T Complete index sets of recursively enumerable families
%J Compositio Mathematica
%D 1972
%P 83-91
%V 24
%N 1
%I Wolters-Noordhoff Publishing
%U http://archive.numdam.org/item/CM_1972__24_1_83_0/
%G en
%F CM_1972__24_1_83_0
McLaughlin, T. G. Complete index sets of recursively enumerable families. Compositio Mathematica, Tome 24 (1972) no. 1, pp. 83-91. http://archive.numdam.org/item/CM_1972__24_1_83_0/

J.C.E. Dekker AND J. Myhill [1] Some theorems on classes of recursively enumerable sets, Trans. Amer. Math. Soc. 89(1) (1958) 25-59. | MR | Zbl

T.G. Mclaughlin [2] The family of all recursively enumerable classes of finite sets, Trans. Amer. Math. Soc., 155 (1) (1971) 127-136. | MR | Zbl

H.G. Rice [3 ] Classes of recursively enumerable sets and their decision problems, Trans. Amer. Math. Soc. 74(2) (1953) 358-366. | MR | Zbl

Hartley Rogers [4] Computing degrees of unsolvability, Math. Annalen, 138(2) (1959) 125-140. | MR | Zbl

Hartley Rogers [5] Theory of recursive functions and effective computability, McGraw-Hill Book Co., 1967. | MR | Zbl