Completeness, the recursion theorem, and effectively simple sets
HTML articles powered by AMS MathViewer
- by Donald A. Martin PDF
- Proc. Amer. Math. Soc. 17 (1966), 838-842 Request permission
References
- 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
- 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
- Donald A. Martin, A theorem on hyperhypersimple sets, J. Symbolic Logic 28 (1963), 273–278. MR 177887, DOI 10.2307/2271305
- John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
- 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
- Gerald E. Sacks, A simple set which is not effectively simple, Proc. Amer. Math. Soc. 15 (1964), 51–55. MR 156780, DOI 10.1090/S0002-9939-1964-0156780-4
- J. R. Shoenfield, Quasicreative sets, Proc. Amer. Math. Soc. 8 (1957), 964–967. MR 89808, DOI 10.1090/S0002-9939-1957-0089808-7
- Raymond M. Smullyan, Effectively simple sets, Proc. Amer. Math. Soc. 15 (1964), 893–895. MR 180485, DOI 10.1090/S0002-9939-1964-0180485-7
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 17 (1966), 838-842
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9939-1966-0216950-5
- MathSciNet review: 0216950