Two Theorems on Hyperhypersimple Sets
Open Access
- 1 September 1967
- journal article
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 128 (3) , 531-538
- https://doi.org/10.2307/1994474
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 9 references indexed in Scilit:
- On the Lattice of Recursively Enumerable SetsTransactions of the American Mathematical Society, 1968
- Linear orderings under one-one reducibilityThe Journal of Symbolic Logic, 1966
- Two Remarks on Indecomposable Number SetsMathematical Logic Quarterly, 1966
- Three theorems on the degrees of recursively enumerable setsDuke Mathematical Journal, 1965
- A maximal set which is not complete.The Michigan Mathematical Journal, 1964
- Some observations on quasicohesive sets.The Michigan Mathematical Journal, 1964
- Approximations of functions on the integersPacific Journal of Mathematics, 1963
- Recursively Enumerable Sets and Retracing FunctionsMathematical Logic Quarterly, 1962
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958