On the reducibility of computable numerations
- 1 March 1969
- journal article
- research article
- Published by Springer Nature in Algebra and Logic
- Vol. 8 (2) , 145-151
- https://doi.org/10.1007/bf02219834
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Three theorems on the degrees of recursively enumerable setsDuke Mathematical Journal, 1965
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958