Subsystems of Second-Order Arithmetic

Springer-Verlag (1999)
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 ...
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Buy the book $100.35 used (17% off)   $105.63 new (12% off)   $119.99 direct from Amazon    Amazon page
ISBN(s) 052188439X   9780521884396  
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 21,357
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Martin Fischer (2009). Minimal Truth and Interpretability. Review of Symbolic Logic 2 (4):799-815.

View all 59 citations / Add more citations

Similar books and articles
Jeffrey Ketland (2001). Stephen G. Simpson Subsystems of Second-Order Arithmetic. British Journal for the Philosophy of Science 52 (1):191-195.
J. Michael Dunn (1980). Quantum Mathematics. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.

Monthly downloads

Added to index


Total downloads

3 ( #638,459 of 1,911,313 )

Recent downloads (6 months)

1 ( #457,064 of 1,911,313 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.