Computable single-valued numerations
- 1 September 1980
- journal article
- research article
- Published by Springer Nature in Algebra and Logic
- Vol. 19 (5) , 325-356
- https://doi.org/10.1007/bf01669607
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The computable enumerations of families of general recursive functionsAlgebra and Logic, 1972
- Two existence theorems for computable numerationsAlgebra and Logic, 1969
- On the reducibility of computable numerationsAlgebra and Logic, 1969
- A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITIONMathematical Logic Quarterly, 1964
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958