×

Charakterisierung der Aufzählungsreduzierbarkeit. (German) Zbl 0496.03024

MSC:

03D30 Other degrees and reducibilities in computability and recursion theory
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Hebeisen, F.: Vergleich verschiedener Begriffe für relative Berechenbarkeit, Diplomarbeit, Freiburg i.Br., 1973.
[2] Kleene, S.C.: Introduction to metamathematics. Princeton, N.J.: D. van Nostrand, Inc., 1952. · Zbl 0047.00703
[3] Myhill, J.: Note on degrees of partial functions. Proceedings of the American Mathematical Society12, 519–521 (1961). · Zbl 0101.01201 · doi:10.1090/S0002-9939-1961-0125794-X
[4] Platek, R. A.: Foundations of recursion theory. Ph.D. Dissertation, Stanford University, 1966.
[5] Rogers, H.: Theory of recursive functions and effective computability. New York: McGraw-Hill Book Company, 1967. · Zbl 0183.01401
[6] Sasso, L.P.: A survey of partial degrees. Journal of Symbolic Logic40, 130–140 (1975). · Zbl 0318.02043 · doi:10.2307/2271892
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.