Reduzierbarkeit von Berechenbaren Numerierungen von P1

Mathematical Logic Quarterly 26 (28-30):445-458 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Theorie Der Numerierungen III.Ju L. Erš - 1976 - Mathematical Logic Quarterly 23 (19‐24):289-371.
Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.
Theorie der Numerierungen II.J. U. L. Eršov - 1975 - Mathematical Logic Quarterly 21 (1):473-584.
Theorie Der Numerierungen III.Ju L. Erš - 1977 - Mathematical Logic Quarterly 23 (19-24):289-371.
Vagheit, empirische Reihen und Zeitordnung.Reinhard Kleinknecht - 1983 - Grazer Philosophische Studien 20 (1):97-115.
Vagheit, empirische Reihen und Zeitordnung.Reinhard Kleinknecht - 1983 - Grazer Philosophische Studien 20 (1):97-115.
Beiträge zur Philosophie von Stephan Körner.Reinhard Kleinknecht - 1983 - Grazer Philosophische Studien 20 (1):97-115.

Analytics

Added to PP
2014-01-16

Downloads
22 (#669,532)

6 months
2 (#1,157,335)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references