On Degrees of Recursive Unsolvability

Journal of Symbolic Logic 22 (4):374-375 (1957)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2963943

Other Versions

No versions found

Links

PhilArchive



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

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

On Suborderings of Degrees of Recursive Unsolvability.Gerald E. Sacks - 1961 - Mathematical Logic Quarterly 7 (1-5):46-56.
The Upper Semi-Lattice of Degrees of Recursive Unsolvability.S. C. Kleene & Emil L. Post - 1956 - Journal of Symbolic Logic 21 (4):407-408.
Spector Clifford. On degrees of recursive unsolvability. Annals of mathematics, ser. 2 vol. 64 , pp. 581–592.Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):374-375.
Gerald E. Sacks. On suborderings of degrees of recursive unsolvability. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 46–56. [REVIEW]Gustav B. Hensel - 1964 - Journal of Symbolic Logic 29 (4):203.
Kleene S. C. and Post Emil L.. The upper semi-lattice of degrees of recursive unsolvability. Annals of mathematics, ser. 2 vol. 59 , pp. 379–407. [REVIEW]Hartley Rogers - 1956 - Journal of Symbolic Logic 21 (4):407-408.
Spector Clifford. Recursive well-orderings.Werner Markwald - 1956 - Journal of Symbolic Logic 21 (4):412-413.
Degrees of unsolvability.Joseph Robert Shoenfield - 1971 - New York,: American Elsevier.
Clifford Spector. Recursive ordinals and predicative set theory. 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. 377–382. [REVIEW]D. A. Clarke - 1966 - Journal of Symbolic Logic 31 (1):138-138.
Spector Clifford. Provably recursive functionals of analysis: A consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 1–27. [REVIEW]R. E. Vesley - 1967 - Journal of Symbolic Logic 32 (1):128-128.

Analytics

Added to PP
2015-02-05

Downloads
12 (#1,372,094)

6 months
6 (#866,322)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Closed choice and a uniform low basis theorem.Vasco Brattka, Matthew de Brecht & Arno Pauly - 2012 - Annals of Pure and Applied Logic 163 (8):986-1008.
Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
Minimal α-degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393-414.

View all 15 citations / Add more citations

References found in this work

No references found.

Add more references