Review: Richard M. Friedberg, A Criterion for Completeness of Degrees of Unsolvability [Book Review]

Journal of Symbolic Logic 25 (2):165-165 (1960)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964226

Other Versions

No versions found

Links

PhilArchive



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

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

A criterion for completeness of degrees of unsolvability.Richard Friedberg - 1957 - Journal of Symbolic Logic 22 (2):159-160.
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.
Friedberg R. M.. Two recursively enumerable sets of incomparable degrees of unsolvability . Proceedings of the National Academy of Sciences of the United States of America, vol. 43 , pp. 236–238. [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.
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.
Friedberg R. M.. The fine structure of degrees of unsolvability of recursively enumerable sets. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 404–406. [REVIEW]Gerald E. Sacks - 1963 - Journal of Symbolic Logic 28 (2):166-166.
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.
Richard M. Friedberg and Hartley RogersJr., Reducibility and completeness for sets of integers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 , pp. 117–125. [REVIEW]Gerald E. Sacks - 1960 - Journal of Symbolic Logic 25 (4):362-363.
Friedberg Richard M., 4-quantifier completeness: A Banach-Mazur functional not uniformly partial recursive. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 6 , pp. 1–5. [REVIEW]Alonzo Church - 1959 - Journal of Symbolic Logic 24 (1):52-52.

Analytics

Added to PP
2013-11-22

Downloads
53 (#412,499)

6 months
15 (#212,687)

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