Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
Goncharov, S.S. The problem of the number of non-self-equivalent constructivizations. Sov. Math. Dokl. 21, 411–414, 1980
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
Kummer, M. Numberings of R1∪F. in: CSL'88, (Eds.: E. Börger, H. Kleine Büning, M. M. Richter), Lecture Notes in Computer Science 385, p.166–186, Springer-Verlag, Berlin, 1989.
An easy priority-free proof of a theorem of Friedberg. to appear in: Theoretical Computer Science
Beiträge zur Theorie der Numerierungen: Eindeutige Numerierungen. Dissertation, Universität Karlsruhe, Fakultät für Informatik, 1989
Lachlan, A.H. Standard classes of recursively enumerable sets. Z. Math. Logik Grundlag. Math. 10, 23–42, 1964
On recursive enumeration without repetition. Z. Math. Logik Grundlag. Math. 11, 209–220, 1965
On recursive enumeration without repetition: A correction. Z. Math. Logik Grundlag. Math. 13, 99–100, 1967
Liu, S. An enumeration of the primitive recursive functions without repetition. Tohoku Math. J. 12, 400–402, 1960
Mal'tsev, A.I. Algorithms and recursive functions. English Translation: Wolters-Noordhoff Publishing, Groningen, 1970; Russian Edition: Izdatelstvo Nauka, Moskva, 1965; German Translation: Vieweg-Verlag, Braunschweig, 1974
Marchenkov, S.S. On minimal numerations of systems of recursively enumerable sets. Sov. Math. Dokl. 12, 843–845, 1971
Pour-El, M.B. Review of. J. Symbolic Logic 35, 223–229, 1960
Pour-El, M.B. and Putnam, H. Recursively enumerable classes and their application to sequences of formal theories. Arch. math. Logik und Grundlagenforsch. 8, 104–121, 1965
Rogers, H. jr. Theory of recursive functions and effective computability. McGraw-Hill Book Company, New York, 1967
Soare, R.I. Recursively enumerable sets and degrees. Springer-Verlag, Berlin, 1987
Wolf, C.E. Standard recursively enumerable classes I. Notices Amer. Math. Soc. 11, 386, 1964
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Kummer, M. (1990). Recursive enumeration without repetition revisited. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086122
Download citation
DOI: https://doi.org/10.1007/BFb0086122
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52772-5
Online ISBN: 978-3-540-47142-4
eBook Packages: Springer Book Archive