A minimal degree less than $0’$
HTML articles powered by AMS MathViewer
- by Gerald E. Sacks PDF
- Bull. Amer. Math. Soc. 67 (1961), 416-419
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
- A. A. Mučnik, On the unsolvability of the problem of reducibility in the theory of algorithms, Dokl. Akad. Nauk SSSR (N.S.) 108 (1956), 194–197 (Russian). MR 0081859
- J. R. Shoenfield, On degrees of unsolvability, Ann. of Math. (2) 69 (1959), 644–653. MR 105355, DOI 10.2307/1970028
- Clifford Spector, On degrees of recursive unsolvability, Ann. of Math. (2) 64 (1956), 581–592. MR 82457, DOI 10.2307/1969604
Additional Information
- Journal: Bull. Amer. Math. Soc. 67 (1961), 416-419
- DOI: https://doi.org/10.1090/S0002-9904-1961-10652-6
- MathSciNet review: 0126380