Subsystems of Second Order Arithmetic

Springer Verlag (1999)

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 ...

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,805

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2011-03-20

Downloads
24 (#478,770)

6 months
1 (#386,031)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references

Similar books and articles

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.
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.