Review: Stephen G. Simpson, Friedman's Research on Subsystems of Second Order Arithmetic [Book Review]

Journal of Symbolic Logic 55 (2):870-874 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

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

Stephen G. Simpson. Friedman's research on subsystems of second order arithmetic. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 137–159. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.
Review: Stephen G. Simpson, Subsystems of Second Order Arithmetic. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
Stephen G. Simpson. Subsystems of second order arithmetic. Perspectives in mathematical logic. Springer, Berlin, Heidelberg, New York, etc., 1999, xiv + 445 pp. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
Friedman's Research on Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1990 - Journal of Symbolic Logic 55 (2):870-874.
Logic and computation, Proceedings of a workshop held at Carnegie Mellon University, June 30–July 2, 1987, edited by Wilfried Sieg, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence1990, xiv + 297 pp. - Douglas K. Brown. Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic. Pp. 39–50. - Kostas Hatzikiriakou and Stephen G. Simpson. WKL0 and orderings of countable abelian groups. Pp. 177–180. - Jeffry L. Hirst. Marriage theorems and reverse mathematics. Pp. 181–196. - Xiaokang Yu. Radon–Nikodym theorem is equivalent to arithmetical comprehension. Pp. 289–297. - Fernando Ferreira. Polynomial time computable arithmetic. Pp. 137–156. - Wilfried Buchholz and Wilfried Sieg. A note on polynomial time computable arithmetic. Pp. 51–55. - Samuel R. Buss. Axiomatizations and conservation results for fragments of bounded arithmetic. Pp. 57–84. - Gaisi Takeuti. Sharply bounded arithmetic and the function a – 1. Pp. 2. [REVIEW]Jörg Hudelmaier - 1996 - Journal of Symbolic Logic 61 (2):697-699.
Stephen G. Simpson subsystems of second-order arithmetic.Jeffrey Ketland - 2001 - British Journal for the Philosophy of Science 52 (1):191-195.
Review: Wilfried Buchholz, Wolfram Pohlers, Wilfried Sieg, Iterated Inductive Definitions and Subsystems of Analysis. [REVIEW]Helmut Pfeiffer - 1994 - Journal of Symbolic Logic 59 (2):668-670.
Review: Wilfried Sieg, Fragments of Arithmetic. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (4):1054-1055.
STEVEN G. SIMPSON. Subsystems of Second Order Arithmetic.Jp Burgess - 2000 - Philosophia Mathematica 8 (1):84-90.
Review: Angus Macintyre, L. Pacholski, J. Wierzejewski, A. J. Wilkie, Ramsey Quantifiers in Arithmetic; James H. Schmerl, Stephen G. Simpson, On the Role of Ramsey Quantifiers in First Order Arithmetic; Carl Morgenstern, On Generalized Quantifiers in Arithmetic. [REVIEW]L. A. S. Kirby - 1985 - Journal of Symbolic Logic 50 (4):1078-1079.

Analytics

Added to PP
2013-11-02

Downloads
48 (#322,453)

6 months
3 (#1,206,820)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Wilfried Sieg
Carnegie Mellon University

Citations of this work

Hilbert's Program Revisited.Panu Raatikainen - 2003 - Synthese 137 (1-2):157-177.

Add more citations

References found in this work

No references found.

Add more references