Subsystems of Second Order Arithmetic

Springer Verlag (1999)
  Copy   BIBTEX

Abstract

Stephen George Simpson. with definition 1.2.3 and the discussion following it. For example, taking 90(n) to be the formula n §E Y, we have an instance of comprehension, VYEIXVn(n€X<—>n¢Y), asserting that for any given set Y there exists a ...

Categories

Keywords

Reprint years

2009

ISBN(s)

052188439X   9780521884396   0521150140   3642642039   3540648828

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

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

The baire category theorem in weak subsystems of second-order arithmetic.Douglas K. Brown & Stephen G. Simpson - 1993 - Journal of Symbolic Logic 58 (2):557-578.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
Stephen G. Simpson subsystems of second-order arithmetic.Jeffrey Ketland - 2001 - British Journal for the Philosophy of Science 52 (1):191-195.
Fundamental notions of analysis in subsystems of second-order arithmetic.Jeremy Avigad - 2006 - Annals of Pure and Applied Logic 139 (1):138-184.
The Pointwise Ergodic Theorem in Subsystems of Second-Order Arithmetic.Ksenija Simic - 2007 - Journal of Symbolic Logic 72 (1):45 - 66.
A note on Goodman's theorem.Ulrich Kohlenbach - 1999 - Studia Logica 63 (1):1-5.
Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
Three theorems of Godel.Andrew Boucher - manuscript
"True" arithmetic can prove its own consistency.Andrew Boucher -
Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
Induction, more or less.Peter Smith - unknown

Analytics

Added to PP
2011-03-20

Downloads
31 (#504,675)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Axioms in Mathematical Practice.Dirk Schlimm - 2013 - Philosophia Mathematica 21 (1):37-92.
Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.
Predicativity.Solomon Feferman - 2005 - In Stewart Shapiro (ed.), Oxford Handbook of Philosophy of Mathematics and Logic. Oxford: Oxford University Press. pp. 590-624.

View all 126 citations / Add more citations

References found in this work

No references found.

Add more references