Weak theories of nonstandard arithmetic and analysis

Abstract
A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,349
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
A Functional Interpretation for Nonstandard Arithmetic.Benno van den Berg, Eyvind Briseid & Pavol Safarik - 2012 - Annals of Pure and Applied Logic 163 (12):1962-1994.
Nonstandard Arithmetic and Recursive Comprehension.H. Jerome Keisler - 2010 - Annals of Pure and Applied Logic 161 (8):1047-1062.
More Infinity for a Better Finitism.Sam Sanders - 2010 - Annals of Pure and Applied Logic 161 (12):1525-1540.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
24 ( #216,351 of 2,193,746 )

Recent downloads (6 months)
2 ( #145,875 of 2,193,746 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature