Two theorems on hyperhypersimple sets

Robinson, Robert W.

doi:10.1090/S0002-9947-1967-0215714-1

Two theorems on hyperhypersimple sets
HTML articles powered by AMS MathViewer

by Robert W. Robinson

Trans. Amer. Math. Soc. 128 (1967), 531-538

DOI: https://doi.org/10.1090/S0002-9947-1967-0215714-1

PDF | Request permission

References

Richard M. Friedberg, Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication, J. Symbolic Logic 23 (1958), 309–316. MR 109125, DOI 10.2307/2964290
A. H. Lachlan, On the lattice of recursively enumerable sets, Trans. Amer. Math. Soc. 130 (1968), 1–37. MR 227009, DOI 10.1090/S0002-9947-1968-0227009-1
T. G. McLaughlin, Some observations on quasicohesive sets, Michigan Math. J. 11 (1964), 83–87. MR 159756
T. G. McLaughlin, Two remarks on indecomposable number sets, Z. Math. Logik Grundlagen Math. 12 (1966), 187–190. MR 197316, DOI 10.1002/malq.19660120114
Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284–316. MR 10514, DOI 10.1090/S0002-9904-1944-08111-1
Gene F. Rose and Joseph S. Ullian, Approximations of functions on the integers, Pacific J. Math. 13 (1963), 693–701. MR 154798
Gerald E. Sacks, A maximal set which is not complete, Michigan Math. J. 11 (1964), 193–205. MR 166090
C. E. M. Yates, Recursively enumerable sets and retracing functions, Z. Math. Logik Grundlagen Math. 8 (1962), 331–345. MR 146072, DOI 10.1002/malq.19620080313
C. E. M. Yates, Three theorems on the degrees of recursively enumerable sets, Duke Math. J. 32 (1965), 461–468. MR 180486
Paul R. Young, Linear orderings under one-one reducibility, J. Symbolic Logic 31 (1966), 70–85. MR 231720, DOI 10.2307/2270621