Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

A note on bounded-truth-table reducibility


Author: Patrick C. Fischer
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
Full-text PDF Free Access

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • [1] E. L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284-316. MR 0010514 (6:29f)
  • [2] J. Dekker, Two notes on recursively enumerable sets, Proc. Amer. Math. Soc. 4 (1953), 495-501. MR 0058533 (15:385a)
  • [3] J. Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97-108. MR 0071379 (17:118g)
  • [4] H. Rogers, Jr., The present theory of Turing machine computability, J. Soc. Indust. Appl. Math. 7 (1959), 114-130. MR 0099923 (20:6359)
  • [5] J. Shoenfield, Quasicreative sets, Proc. Amer. Math. Soc. 8 (1957), 964-967. MR 0089808 (19:723b)
  • [6] J. Dekker, A theorem on hypersimple sets, Proc. Amer. Math. Soc. 5 (1954) 791-796. MR 0063995 (16:209b)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 02.70

Retrieve articles in all journals with MSC: 02.70


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1963-0155757-1
Article copyright: © Copyright 1963 American Mathematical Society

American Mathematical Society