Complete recursively enumerable sets
HTML articles powered by AMS MathViewer
- by A. H. Lachlan PDF
- Proc. Amer. Math. Soc. 19 (1968), 99-102 Request permission
References
- Richard M. Friedberg, Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication, J. Symbolic Logic 23 (1958), 309–316. MR 109125, DOI 10.2307/2964290
- Donald A. Martin, Completeness, the recursion theorem, and effectively simple sets, Proc. Amer. Math. Soc. 17 (1966), 838–842. MR 216950, DOI 10.1090/S0002-9939-1966-0216950-5
- John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 71379, DOI 10.1002/malq.19550010205
- Raymond M. Smullyan, Effectively simple sets, Proc. Amer. Math. Soc. 15 (1964), 893–895. MR 180485, DOI 10.1090/S0002-9939-1964-0180485-7
Additional Information
- © Copyright 1968 American Mathematical Society
- 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