Skip to main content
Log in

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literatur

  1. Carstens, H. G.: Über die Kompliziertheit numerischer Modelle. Dissertation, Münster, 1972.

    Google Scholar 

  2. Carstens, H. G.: Reducing hyperarithmetic sequences. Fundamenta Mathematicae LXXXIX, 5–11. (1975).

    Google Scholar 

  3. Jockusch, C. G.:Π 01 classes and boolean combinations of recursively enumerable sets. JSL39, 95–96 (1974).

    Google Scholar 

  4. Müller, G. H.: Nicht-Standardmodelle der Zahlentheorie. Math. Zeitschrift77, 414–438 (1961).

    Google Scholar 

  5. Rogers, H.: Theory of recursive functions and effective computability. New York, 1967.

  6. Schwichtenberg, H.: Eine Klassifikation der mehrfach rekursiven Funktionen. Dissertation Münster 1968.

    Google Scholar 

  7. Shapiro: Review. JSL36 (1971).

  8. Shoenfield, J. R.: Mathematical logic. Reading (Mass.) 1967.

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Von Carstens, H.G. Δ 02 -Mengen. Arch math Logik 18, 55–65 (1977). https://doi.org/10.1007/BF02007257

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02007257

Navigation