Mathematical Logic Quarterly 22 (1):165-168 (1976)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1002/malq.19760220122
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,039
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Computably Enumerable Sets and Quasi-Reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.

Add more citations

Similar books and articles

Zur Programmkomplexität Rekursiv Aufzählbarer Mengen.Hans-Dietrich Hecker - 1976 - Mathematical Logic Quarterly 22 (1):239-244.
Ein Erkenntnismodell Des Nikolaus Von Kues Und der Grad der Bewährung Einer Wissenschaftlichen Hypothese.Otto-Joachim Grüsser - 1988 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 19 (2):232-238.
Iulia Grad.Iulia Grad - 2010 - Journal for the Study of Religions and Ideologies 9 (25):192-194.
Schiffer-Epistemologie.Georg Meggle - 1980 - Grazer Philosophische Studien 10 (1):91-103.
Idee Und Grundriß Einer Nicht-Aristotelischen Logik. Band I.D. D. O. - 1960 - Review of Metaphysics 13 (4):701-701.


Added to PP index

Total views
12 ( #809,029 of 2,505,228 )

Recent downloads (6 months)
7 ( #102,841 of 2,505,228 )

How can I increase my downloads?


My notes