Nonstandard second-order arithmetic and Riemann's mapping theorem
نویسندگان
چکیده
In this paper, we introduce systems of nonstandard second-order arithmetic which are conservative extensions of systems of second-order arithmetic. Within these systems, we do reverse mathematics for nonstandard analysis, and we can import techniques of nonstandard analysis into analysis in weak systems of second-order arithmetic. Then, we apply nonstandard techniques to a version of Riemann’s mapping theorem, and show several different versions of Riemann’s mapping theorem.
منابع مشابه
Nonstandard Models in Recursion Theory and Reverse Mathematics
We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models, and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey’s Theorem for Pairs.
متن کاملNonstandard arithmetic and reverse mathematics
We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard arithmetic. In the earlier paper [HKK1984] we introduced saturation principles in nonstandard arithmetic which are equivalent in strength to strong choice axioms in second order arithmetic. This paper studies principles ...
متن کاملHyperreals and Their Applications
NSA can be introduced in multiple ways. Instead of choosing one option, these notes include three introductions. Section 1 is best-suited for those who are familiar with logic, or who want to get a flavor of model theory. Section 2 focuses on some common ingredients of various axiomatic approaches to NSA, including the star-map and the Transfer principle. Section 3 explains the ultrapower const...
متن کاملAn Effective Conservation Result for Nonstandard Arithmetic
We prove that a nonstandard extension of arithmetic is eeectively conservative over Peano arithmetic by using an internal version of a deenable ultrapower. By the same method we show that a certain extension of the nonstandard theory with a saturation principle has the same proof-theoretic strength as second order arithmetic, where comprehension is restricted to arithmetical formulas.
متن کاملA Bezout Computable Nonstandard Model of Open Induction
In contrast with Tennenbaum’s theorem [8] that says Peano Arithmetic (PA) has no nonstandard computable model, Shepherdson [6] constructed a computable nonstandard model for a very weak fragment of PA, called Open Induction (Iopen) in which the induction scheme is only allowed to be applied for quantifier-free formulas (with parameters). Since then several attempts have been made from both side...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 165 شماره
صفحات -
تاریخ انتشار 2014