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)

 
 

 

Complete recursively enumerable sets


Author: A. H. Lachlan
Journal: Proc. Amer. Math. Soc. 19 (1968), 99-102
MSC: Primary 02.70
DOI: https://doi.org/10.1090/S0002-9939-1968-0221933-7
MathSciNet review: 0221933
Full-text PDF Free Access

References | Similar Articles | Additional Information

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

  • [1] R. M. Friedberg, Three theorems on recursive enumeration, J. Symbolic Logic 23 (1958), 309-316. MR 0109125 (22:13)
  • [2] D. A. Martin, Completeness, the recursion theorem, and effectively simple sets, Proc. Amer. Math. Soc. 17 (1966), 838-842. MR 0216950 (36:45)
  • [3] J. Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97-108. MR 0071379 (17:118g)
  • [4] R. M. Smullyan, Effectively simple sets, Proc. Amer. Math. Soc. 15 (1964), 893-894. MR 0180485 (31:4720)

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-1968-0221933-7
Article copyright: © Copyright 1968 American Mathematical Society

American Mathematical Society