On semi-cylinders, splinters, and bounded-truth-table reducibility
HTML articles powered by AMS MathViewer
- by Paul R. Young
- Trans. Amer. Math. Soc. 115 (1965), 329-339
- DOI: https://doi.org/10.1090/S0002-9947-1965-0209151-1
- PDF | Request permission
References
- Patrick C. Fischer, A note on bounded-truth-table reducibility, Proc. Amer. Math. Soc. 14 (1963), 875–877. MR 155757, DOI 10.1090/S0002-9939-1963-0155757-1
- John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
- John Myhill, Recursive digraphs, splinters and cylinders, Math. Ann. 138 (1959), 211–218. MR 111684, DOI 10.1007/BF01342904
- 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-London, 1967. MR 0224462
- J. R. Shoenfield, Quasicreative sets, Proc. Amer. Math. Soc. 8 (1957), 964–967. MR 89808, DOI 10.1090/S0002-9939-1957-0089808-7
- Paul R. Young, A note on pseudo-creative sets and cylinders, Pacific J. Math. 14 (1964), 749–753. MR 162714, DOI 10.2140/pjm.1964.14.749
Bibliographic Information
- © Copyright 1965 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 115 (1965), 329-339
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9947-1965-0209151-1
- MathSciNet review: 0209151