A theorem on intermediate reducibilities
HTML articles powered by AMS MathViewer
- by T. G. McLaughlin PDF
- Proc. Amer. Math. Soc. 19 (1968), 87-90 Request permission
References
- Richard M. Friedberg and Hartley Rogers Jr., Reducibility and completeness for sets of integers, Z. Math. Logik Grundlagen Math. 5 (1959), 117–125. MR 112831, DOI 10.1002/malq.19590050703
- S. C. Kleene and Emil L. Post, The upper semi-lattice of degrees of recursive unsolvability, Ann. of Math. (2) 59 (1954), 379–407. MR 61078, DOI 10.2307/1969708
- A. H. Lachlan, Some notions of reducibility and productiveness, Z. Math. Logik Grundlagen Math. 11 (1965), 17–44. MR 172795, DOI 10.1002/malq.19650110104
- T. G. McLaughlin, On relative coimmunity, Pacific J. Math. 15 (1965), 1319–1327. MR 189990
- Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284–316. MR 10514, DOI 10.1090/S0002-9904-1944-08111-1
- Paul R. Young, On semi-cylinders, splinters, and bounded-truth-table reducibility, Trans. Amer. Math. Soc. 115 (1965), 329–339. MR 209151, DOI 10.1090/S0002-9947-1965-0209151-1
Additional Information
- © Copyright 1968 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 19 (1968), 87-90
- MSC: Primary 02.77
- DOI: https://doi.org/10.1090/S0002-9939-1968-0219420-5
- MathSciNet review: 0219420