Friedman's Research on Subsystems of Second Order Arithmetic

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274673

Links

PhilArchive



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

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

Review: Stephen G. Simpson, Friedman's Research on Subsystems of Second Order Arithmetic. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.
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.
Stephen G. Simpson subsystems of second-order arithmetic.Jeffrey Ketland - 2001 - British Journal for the Philosophy of Science 52 (1):191-195.
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.
Stephen G. Simpson. Nonprovability of certain combinatorial properties of finite trees. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. Ṧčedrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 87–117. , pp. 45–65.). [REVIEW]W. Buchholz - 1990 - Journal of Symbolic Logic 55 (2):868-869.
Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic.Jeremy Avigad - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Conservativity of ultrafilters over subsystems of second order arithmetic.Antonio Montalbán & Richard A. Shore - 2018 - Journal of Symbolic Logic 83 (2):740-765.

Analytics

Added to PP
2015-02-05

Downloads
25 (#150,191)

6 months
5 (#1,552,255)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

An effective proof that open sets are Ramsey.Jeremy Avigad - 1998 - Archive for Mathematical Logic 37 (4):235-240.
Hilbert's Program Revisited.Panu Raatikainen - 2003 - Synthese 137 (1-2):157-177.

View all 8 citations / Add more citations

References found in this work

No references found.

Add more references