Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- 1 January 1966
- journal article
- research article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 12 (1) , 295-310
- https://doi.org/10.1002/malq.19660120125
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A maximal set which is not complete.The Michigan Mathematical Journal, 1964
- Splinters of recursive functionsThe Journal of Symbolic Logic, 1960
- Computing degrees of unsolvabilityMathematische Annalen, 1959
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- Quasicreative SetsProceedings of the American Mathematical Society, 1957
- Quasicreative setsProceedings of the American Mathematical Society, 1957
- Recursive and Recursively Enumerable OrdersTransactions of the American Mathematical Society, 1956
- Recursive and recursively enumerable ordersTransactions of the American Mathematical Society, 1956
- A theorem on hypersimple setsProceedings of the American Mathematical Society, 1954
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944