Two existence theorems for computable numerations
- 1 July 1969
- journal article
- Published by Springer Nature in Algebra and Logic
- Vol. 8 (4) , 277-282
- https://doi.org/10.1007/bf02306734
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On the reducibility of computable numerationsAlgebra and Logic, 1969
- Classes of Recursively Enumerable Sets and Degrees of UnsolvabilityMathematical Logic Quarterly, 1966
- Three theorems on the degrees of recursively enumerable setsDuke Mathematical Journal, 1965