|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)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Michal Rössler & Emil Jeřábek (2007). Fragment of Nonstandard Analysis with a Finitary Consistency Proof. Bulletin of Symbolic Logic 13 (1):54-70.
Kenneth McAloon (1982). On the Complexity of Models of Arithmetic. Journal of Symbolic Logic 47 (2):403-415.
Arnold Beckmann (2002). Proving Consistency of Equational Theories in Bounded Arithmetic. Journal of Symbolic Logic 67 (1):279-296.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Stuart T. Smith (1987). Nonstandard Characterizations of Recursive Saturation and Resplendency. Journal of Symbolic Logic 52 (3):842-863.
George Mills & Jeff Paris (1984). Regularity in Models of Arithmetic. Journal of Symbolic Logic 49 (1):272-280.
C. Ward Henson, Matt Kaufmann & H. Jerome Keisler (1984). The Strength of Nonstandard Methods in Arithmetic. Journal of Symbolic Logic 49 (4):1039-1058.
H. Jerome Keisler (2006). Nonstandard Arithmetic and Reverse Mathematics. Bulletin of Symbolic Logic 12 (1):100-125.
Jeremy Avigad & Jeffrey Helzner (2002). Transfer Principles in Nonstandard Intuitionistic Arithmetic. Archive for Mathematical Logic 41 (6):581-602.
Added to index2009-01-28
Total downloads6 ( #154,770 of 722,935 )
Recent downloads (6 months)1 ( #61,087 of 722,935 )
How can I increase my downloads?