On a problem of G. E. Sacks
HTML articles powered by AMS MathViewer
- by A. H. Lachlan
- Proc. Amer. Math. Soc. 16 (1965), 972-979
- DOI: https://doi.org/10.1090/S0002-9939-1965-0182560-0
- PDF | Request permission
References
- Richard M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem, 1944), Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 236–238. MR 84474, DOI 10.1073/pnas.43.2.236
- Gerald E. Sacks, Degrees of unsolvability, Princeton University Press, Princeton, N.J., 1963. MR 0186554
Bibliographic Information
- © Copyright 1965 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 16 (1965), 972-979
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9939-1965-0182560-0
- MathSciNet review: 0182560