References
Cooper, S.B.: Partial degrees and the density problem. J. Symb. Logic47, 854–859 (1982)
Cooper, S.B.: Partial degrees and the density problem. Part 2: the enumeration degrees of theΣ 2 sets are dense. J. Symb. Logic49, 503–513 (1984)
Cooper, S.B.: Enumeration reducibility, non-deterministic computations and relative computability of partial functions. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds.) Recursion Theory Week, Proceedings Oberwolfach. (Lect. Notes Math., vol. 1432, pp. 57–110) Berlin Heidelberg New York: Springer 1989
Friedberg, R.M., Rogers, H. Jr.: Reducibilities and completeness for sets of integers, Zeit. Math. Log. Grund. Math.5, 117–125 (1959)
Gutteridge, L.: Some results on enumeration reducibility. (Thesis) Simon Fraser University (1971)
Jockusch, C.G. Jr.: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc.131, 420–436 (1968)
Jockusch, C.G. Jr., Shore, R.A.: Pseudo-jump operators. II. Transfinite iterations, hierarchies and minimal covers. J. Symb. Logic49, 1205–1236 (1984)
Kleene, S.C.: Introduction to metamathematics. New York: Van Nostrand 1952
Medvedev, Y.T.: Degrees of difficulty of the mass problem. Dokl. Akad. Nauk SSSR,104, 501–504 (1952)
Myhill, J.: A note on degrees of partial functions. Proc. Am. Math. Soc.12, 519–521 (1961)
Rogers, H. Jr.: Theory of recursive functions and effective computability. McGraw Hill, New York: McGraw Hill 1967
Soare, R.I.: Recursively enumerable sets and degrees. Berlin Heidelberg New York: Springer 1987
Author information
Authors and Affiliations
Additional information
Research partially supported by NSERC grant A3040 and MSRI under NSF grant DMS-8505550
Research partially supported by NSF grant DMS-8912797 and MSRI under NSF grant DMS-8505550
Rights and permissions
About this article
Cite this article
Lachlan, A.H., Shore, R.A. Then-rea enumeration degrees are dense. Arch Math Logic 31, 277–285 (1992). https://doi.org/10.1007/BF01794984
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01794984