A simple set which is not effectively simple
HTML articles powered by AMS MathViewer
- by Gerald E. Sacks PDF
- Proc. Amer. Math. Soc. 15 (1964), 51-55 Request permission
References
- 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 84474, DOI 10.1073/pnas.43.2.236
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790 A. A. Muchnik, Negative answer to the problem of reducibility of the theory of algorithms, Dokl. Akad. Nauk SSSR 108 (1956), 194-197. (Russian)
- 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
Additional Information
- © Copyright 1964 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 15 (1964), 51-55
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9939-1964-0156780-4
- MathSciNet review: 0156780