Complete Recursively Enumerable Sets
- 1 February 1968
- journal article
- Published by JSTOR in Proceedings of the American Mathematical Society
- Vol. 19 (1) , 99-102
- https://doi.org/10.2307/2036145
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 4 references indexed in Scilit:
- Completeness, the Recursion Theorem, and Effectively Simple SetsProceedings of the American Mathematical Society, 1966
- Effectively Simple SetsProceedings of the American Mathematical Society, 1964
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- Creative setsMathematical Logic Quarterly, 1955