A minimal partial degree $\leq \textbf {O}^{’}$
HTML articles powered by AMS MathViewer
- by Leonard P. Sasso PDF
- Proc. Amer. Math. Soc. 38 (1973), 388-392 Request permission
Abstract:
We construct, recursively in 0’, a minimal element in the upper semilattice, excluding least element, of Turing degrees of partial functions.References
- S. B. Cooper, Minimal degrees and the jump operator, J. Symbolic Logic 38 (1973), 249–271. MR 347572, DOI 10.2307/2272061
- Gerald E. Sacks, Degrees of unsolvability, Princeton University Press, Princeton, N.J., 1963. MR 0186554
- Leonard P. Sasso Jr., A cornucopia of minimal degrees, J. Symbolic Logic 35 (1970), 383–388. MR 282835, DOI 10.2307/2270695 —, A survey of partial degrees (to appear).
- J. R. Shoenfield, A theorem on minimal degrees, J. Symbolic Logic 31 (1966), 539–544. MR 205850, DOI 10.2307/2269688
- Clifford Spector, On degrees of recursive unsolvability, Ann. of Math. (2) 64 (1956), 581–592. MR 82457, DOI 10.2307/1969604
Additional Information
- © Copyright 1973 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 38 (1973), 388-392
- MSC: Primary 02F30
- DOI: https://doi.org/10.1090/S0002-9939-1973-0311467-5
- MathSciNet review: 0311467