A note on bounded-truth-table reducibility
HTML articles powered by AMS MathViewer
- by Patrick C. Fischer
- Proc. Amer. Math. Soc. 14 (1963), 875-877
- DOI: https://doi.org/10.1090/S0002-9939-1963-0155757-1
- PDF | Request permission
References
- 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
- J. C. E. Dekker, Two notes on recursively enumerable sets, Proc. Amer. Math. Soc. 4 (1953), 495–501. MR 58533, DOI 10.1090/S0002-9939-1953-0058533-7
- John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
- Hartley Rogers Jr., The present theory of Turing machine computability, J. Soc. Indust. Appl. Math. 7 (1959), 114–130. MR 99923
- J. R. Shoenfield, Quasicreative sets, Proc. Amer. Math. Soc. 8 (1957), 964–967. MR 89808, DOI 10.1090/S0002-9939-1957-0089808-7
- 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
Bibliographic Information
- © Copyright 1963 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 14 (1963), 875-877
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9939-1963-0155757-1
- MathSciNet review: 0155757