On computable enumerations

journal article Jan 01, 1969

Algebra and Logic Vol. 8 No. 1 pp. 34-38 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf02219821

Topics

No keywords indexed for this article. Browse by subject →

References

4

[1]

Yu. L. Ershov, ,“On computable enumerations,” Algebrai Logika,7, No. 5, 71–99 (1968).

[2]

Yu. L. Ershov, ,“Enumerations of a family of general recursive functions,” Sibirsk. Matem. Zh.,8, No. 5, 1015–1025 (1967).

[3]

R. M. Friedberg, ,“Three theorems on recursive functions,” J. Symbolic Logic,23, 309–318 (1958). 10.2307/2964290

[4]

Ohashi, ,“A stronger form of a theorem of Friedberg,” Notre Dame J. Formal Logic,5, No. 1, 10–12 (1964). 10.1305/ndjfl/1093957732

Metrics

1

Citations

4

References

Details

Authors

Cite This Article

Yu. L. Ershov, I. A. Lavrov (1969). On computable enumerations. Algebra and Logic, 8(1), 34-38. https://doi.org/10.1007/bf02219821

You May Also Like