Semirecursive sets and positive reducibility
HTML articles powered by AMS MathViewer
- by Carl G. Jockusch PDF
- Trans. Amer. Math. Soc. 131 (1968), 420-436 Request permission
References
- K. I. Appel, There exist two regressive sets whose intersection is not regressive, J. Symbolic Logic 32 (1967), 322–324. MR 215711, DOI 10.2307/2270773
- K. I. Appel and T. G. McLaughlin, On properties of regressive sets, Trans. Amer. Math. Soc. 115 (1965), 83–93. MR 230616, DOI 10.1090/S0002-9947-1965-0230616-0
- J. C. E. Dekker, A theorem on hypersimple sets, Proc. Amer. Math. Soc. 5 (1954), 791–796. MR 63995, DOI 10.1090/S0002-9939-1954-0063995-6
- J. C. E. Dekker, Infinite series of isols, Proc. Sympos. Pure Math., Vol. V, American Mathematical Society, Providence, R.I., 1962, pp. 77–96. MR 0142447
- J. C. E. Dekker, The minimum of two regressive isols, Math. Z. 83 (1964), 345–366. MR 160716, DOI 10.1007/BF01111167
- J. C. E. Dekker and J. Myhill, Recursive equivalence types, Univ. California Publ. Math. 3 (1960), 67–213. MR 0117155
- J. C. E. Dekker and J. Myhill, Retraceable sets, Canadian J. Math. 10 (1958), 357–373. MR 99292, DOI 10.4153/CJM-1958-035-x C. G. Jockusch, Jr., Reducibilities in recursive function theory, Doctoral Dissertation, Massachusetts Institute of Technology, Cambridge, Mass., 1966.
- 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
- Donald A. Martin, Completeness, the recursion theorem, and effectively simple sets, Proc. Amer. Math. Soc. 17 (1966), 838–842. MR 216950, DOI 10.1090/S0002-9939-1966-0216950-5
- Webb Miller and D. A. Martin, The degrees of hyperimmune sets, Z. Math. Logik Grundlagen Math. 14 (1968), 159–166. MR 228341, DOI 10.1002/malq.19680140704
- T. G. McLaughlin, On a class of complete simple sets, Canad. Math. Bull. 8 (1965), 33–37. MR 182561, DOI 10.4153/CMB-1965-006-2
- 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
- Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
- Gerald E. Sacks, Degrees of unsolvability, Princeton University Press, Princeton, N.J., 1963. MR 0186554
- Raymond M. Smullyan, Effectively simple sets, Proc. Amer. Math. Soc. 15 (1964), 893–895. MR 180485, DOI 10.1090/S0002-9939-1964-0180485-7
- C. E. M. Yates, Recursively enumerable sets and retracing functions, Z. Math. Logik Grundlagen Math. 8 (1962), 331–345. MR 146072, DOI 10.1002/malq.19620080313
- C. E. M. Yates, Three theorems on the degrees of recursively enumerable sets, Duke Math. J. 32 (1965), 461–468. MR 180486
- Paul R. Young, A note on pseudo-creative sets and cylinders, Pacific J. Math. 14 (1964), 749–753. MR 162714
Additional Information
- © Copyright 1968 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 131 (1968), 420-436
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9947-1968-0220595-7
- MathSciNet review: 0220595