Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Friedberg, R.M. Three theorems on recursive enumeration. I. Decomposition II. Maximal set III. Enumeration without duplication. J. Symbolic Logic 23, p. 309–316, 1958
2. Goncharov, S.S. The problem of the number of non-self-equivalent constructivizations. Sov. Math. Dokl. 21, 411–414, 1980
3. Howard, W.A. and Pour-El, M.B. A structural criterion for recursive enumeration without repetition. Z. Math. Logik Grundlag. Math. 10, 105–114, 1964
4. Lecture Notes in Computer Science;M. Kummer,1989
5. An easy priority-free proof of a theorem of Friedberg. to appear in: Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献