A Dichotomy of the Recursively Enumerable Sets
- 1 January 1968
- journal article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 14 (21-24) , 339-356
- https://doi.org/10.1002/malq.19680142105
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Complete Recursively Enumerable SetsProceedings of the American Mathematical Society, 1968
- Complete recursively enumerable setsProceedings of the American Mathematical Society, 1968
- Two Theorems on Hyperhypersimple SetsTransactions of the American Mathematical Society, 1967
- Simplicity of recursively enumerable setsThe Journal of Symbolic Logic, 1967
- Recursion, metarecursion, and inclusionThe Journal of Symbolic Logic, 1967
- Three theorems on the degrees of recursively enumerable setsDuke Mathematical Journal, 1965
- A maximal set which is not complete.The Michigan Mathematical Journal, 1964
- A theorem on hyperhypersimple setsThe Journal of Symbolic Logic, 1963
- A theorem on maximal sets.Notre Dame Journal of Formal Logic, 1961
- A theorem on hypersimple setsProceedings of the American Mathematical Society, 1954