Remote Access Bulletin of the American Mathematical Society

Bulletin of the American Mathematical Society

ISSN 1088-9485(online) ISSN 0273-0979(print)

 
 

 

A minimal degree less than $0'$


Author: Gerald E. Sacks
Journal: Bull. Amer. Math. Soc. 67 (1961), 416-419
DOI: https://doi.org/10.1090/S0002-9904-1961-10652-6
MathSciNet review: 0126380
Full-text PDF

References | Additional Information

References [Enhancements On Off] (What's this?)

  • 1. Richard M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Nat. Acad. Sci. U. S. A. vol. 43 (1957) pp. 236-238. MR 84474
  • 2. A. A. Muchnik, Negative answer to the problem of reducibility of the theory of algorithms, Dokl. Akad. Nauk SSSR vol. 108 (1956) pp. 194-197 (in Russian). MR 81859
  • 3. J. R. Shoenfield, On degrees of unsolvability, Ann. of Math. vol. 69 (1959) pp. 644-653. MR 105355
  • 4. Clifford Spector, On degrees of recursive unsolvability, Ann. of Math. vol. 64 (1956) pp. 581-592. MR 82457


Additional Information

DOI: https://doi.org/10.1090/S0002-9904-1961-10652-6

American Mathematical Society