Normierte Postsche Algorithmen

Journal of Symbolic Logic 27 (1):87-88 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2963699

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

External links

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

Through your library

My notes

Similar books and articles

Normierte Postsche Algorithmen.Günter Asser - 1959 - Mathematical Logic Quarterly 5 (14-24):323-333.
Marian Boykan Pour-El and Ian Richards. A computable ordinary differential equation which possesses no computable solution, Annals of mathematical logic, vol. 17 , pp. 61–90. - Marian Boykan Pour-El and Ian Richards. The wave equation with computable initial data such that its unique solution is not computable. Advances in mathematics, vol. 39 , pp. 215–239. [REVIEW]G. Kreisel - 1982 - Journal of Symbolic Logic 47 (4):900-902.
Marian Boykan Pour-El. Independent axiomatization and its relation to the hypersimple set. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 , pp. 449–456. [REVIEW]Lawrence Feiner - 1973 - Journal of Symbolic Logic 38 (4):654-655.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
Marian B. Pour-El and J. Ian Richards. Computability in analysis and physics. Perspectives in mathematical logic. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1989, xi + 206 pp. [REVIEW]Oliver Aberth - 1991 - Journal of Symbolic Logic 56 (2):749-750.
Boolesche Funktionen und Postsche Klassen.Sergeĭ Vsevolodovich I︠A︡blonskiĭ - 1970 - Basel,: C. F. Winter. Edited by Gavrilov, Gariĭ Petrovich, [From Old Catalog], Kudri︠a︡vt︠s︡ev & Valeriĭ Borisovich.
Review: Zdenek Zastavka, Uber Algorithmen mit Speicherelementen. [REVIEW]P. Schreiber - 1971 - Journal of Symbolic Logic 36 (2):346-346.

Analytics

Added to PP
2013-11-03

Downloads
55 (#396,474)

6 months
8 (#613,944)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references