Feferman Solomon. Degrees of unsolvability associated with classes of formalized theories [Book Review]

Journal of Symbolic Logic 27 (1):85-86 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2963697

Other Versions

No versions found

Links

PhilArchive

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

Degrees of unsolvability associated with classes of formalized theories.Solomon Feferman - 1957 - Journal of Symbolic Logic 22 (2):161-175.
Rogers Hartley Jr., Computing degrees of unsolvability. Mathematische Annalen, vol. 138 . pp. 125–140.Rogers Hartley Jr., Computing degrees of unsolvability. 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. 277–283. [REVIEW]Steven Orey - 1960 - Journal of Symbolic Logic 25 (4):363-364.
Review: Solomon Feferman, Foundational Ways; Solomon Feferman, Working Foundations. [REVIEW]Maria Dalla Chiara - 1992 - Journal of Symbolic Logic 57 (4):1478-1479.
Review: Solomon Feferman, Transfinite Recursive Progressions of Axiomatic Theories. [REVIEW]A. Ehrenfeucht & S. Feferman - 1967 - Journal of Symbolic Logic 32 (4):530-531.
Solomon Feferman. Toward useful type-free theories I. The journal of symbolic logic, vol. 49, pp. 75–111., pp. 237–287.).Andrea Cantini - 1995 - Journal of Symbolic Logic 60 (1):342-345.
Indefiniteness in semi-intuitionistic set theories: On a conjecture of Feferman.Michael Rathjen - 2016 - Journal of Symbolic Logic 81 (2):742-754.
In memoriam: Hartley Rogers, jr. 1926–2015.Anil Nerode - 2016 - Bulletin of Symbolic Logic 22 (2):294-297.
In Memoriam: Solomon Feferman (1928–2016).Charles Parsons & Wilfried Sieg - 2017 - Bulletin of Symbolic Logic 23 (3):337-344.
S. Feferman and W. Sieg Inductive definitions and subsystems of analysis. Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, by Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Lecture notes in mathematics, vol. 897, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 16–77. - Solomon Feferman and Wilfried Sieg. Proof theoretic equivalences between classical and constructive theories for analysis. Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, by Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Lecture notes in mathematics, vol. 897, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 78–142. - Solomon Feferman. Iterated inductive fixed-point theories: application to Hancock's conjecture. Patras logic symposion, Proceedings of the logic symposion held at Patras, Greece, August 18–22, 1980, edited by George Metakides, Studies in logic.Helmut Pfeiffer - 1994 - Journal of Symbolic Logic 59 (2):668-670.
Degrees of unsolvability.Joseph Robert Shoenfield - 1972 - New York,: American Elsevier.

Analytics

Added to PP
2013-11-03

Downloads
105 (#475,788)

6 months
16 (#751,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