Recursively Enumerable Sets and Retracing Functions
- 1 January 1962
- journal article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 8 (3-4) , 331-345
- https://doi.org/10.1002/malq.19620080313
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- Retraceable SetsCanadian Journal of Mathematics, 1958
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)Proceedings of the National Academy of Sciences, 1957
- Recursive and Recursively Enumerable OrdersTransactions of the American Mathematical Society, 1956
- Recursive and recursively enumerable ordersTransactions of the American Mathematical Society, 1956
- The Upper Semi-Lattice of Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1954
- 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