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 No categories specified
(categorize this paper)
Options
 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: 10,738
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.

Citations of this work BETA
H. Jerome Keisler (2010). Nonstandard Arithmetic and Recursive Comprehension. Annals of Pure and Applied Logic 161 (8):1047-1062.
Sam Sanders (2010). More Infinity for a Better Finitism. Annals of Pure and Applied Logic 161 (12):1525-1540.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

6 ( #201,718 of 1,098,670 )

Recent downloads (6 months)

1 ( #285,836 of 1,098,670 )

How can I increase my downloads?

My notes
Sign in to use this feature


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