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
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 (solution of Post’s problem, 1944), Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 236–238. MR 0084474
  • 2. 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
  • 3. J. R. Shoenfield, On degrees of unsolvability, Ann. of Math. (2) 69 (1959), 644–653. MR 0105355
  • 4. Clifford Spector, On degrees of recursive unsolvability, Ann. of Math. (2) 64 (1956), 581–592. MR 0082457


Additional Information

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