Quasicreative sets
HTML articles powered by AMS MathViewer
- by J. R. Shoenfield
- Proc. Amer. Math. Soc. 8 (1957), 964-967
- DOI: https://doi.org/10.1090/S0002-9939-1957-0089808-7
- PDF | Request permission
References
- J. C. E. Dekker, Productive sets, Trans. Amer. Math. Soc. 78 (1955), 129–149. MR 67049, DOI 10.1090/S0002-9947-1955-0067049-X
- A. A. Mučnik, On the separability of recursively enumerable sets, Dokl. Akad. Nauk SSSR (N.S.) 109 (1956), 29–32 (Russian). MR 0084473
- 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
- V. A. Uspenskiĭ, Gödel’s theorem and the theory of algorithms, Dokl. Akad. Nauk SSSR (N.S.) 91 (1953), 737–740 (Russian). MR 0070591
Bibliographic Information
- © Copyright 1957 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 8 (1957), 964-967
- MSC: Primary 02.0X
- DOI: https://doi.org/10.1090/S0002-9939-1957-0089808-7
- MathSciNet review: 0089808