Charakterisierung der Aufzählungsreduzierbarkeit

  • Friedrich von Hebeisen
Article
  • 16 Downloads

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [1]
    Hebeisen, F.: Vergleich verschiedener Begriffe für relative Berechenbarkeit, Diplomarbeit, Freiburg i.Br., 1973.Google Scholar
  2. [2]
    Kleene, S.C.: Introduction to metamathematics. Princeton, N.J.: D. van Nostrand, Inc., 1952.Google Scholar
  3. [3]
    Myhill, J.: Note on degrees of partial functions. Proceedings of the American Mathematical Society12, 519–521 (1961).Google Scholar
  4. [4]
    Platek, R. A.: Foundations of recursion theory. Ph.D. Dissertation, Stanford University, 1966.Google Scholar
  5. [5]
    Rogers, H.: Theory of recursive functions and effective computability. New York: McGraw-Hill Book Company, 1967.Google Scholar
  6. [6]
    Sasso, L.P.: A survey of partial degrees. Journal of Symbolic Logic40, 130–140 (1975).Google Scholar

Copyright information

© Verlag W. Kohlhammer 1978

Authors and Affiliations

  • Friedrich von Hebeisen
    • 1
  1. 1.Math. Institut der UniversitätFreiburg i. Br.

Personalised recommendations