关于ErdMoser定理的研究.pdfVIP

StudiesinLogic,Vol.6, No. 1 (2013): 39–48 PII:1674-3202(2013)-01-0039-10 * SomeResultsonErdös-Moser Theorem Xiaojun Kang InstituteofLogic and Cognition, Sun Yat-senUniversity DepartmentofPhilosophy,Sun Yat-senUniversity kxj319@ Abstract. In this paper, we get some results on Erdös-Moser theorem. After briefly intro- ducing some basic knowledge about reverse mathematics, we first investigate the strength of Erdös-Moser theorem. There is a computable function such that no infinite set is transitive for . There is a computable function such that every infinite transitive set for is hyperimmune. Then we study the strength of stable Erdös-Moser theo- rem. We show that RCA does not imply stable Erdös-Moser theorem and we also prove that ′ there exists a ∅ -computable infinite transitive set for each given stable computable function by directconstruction. 1 Introduction AfterRussell’sparadox,axiomaticsettheory,especiallyZFC(Zermelo-Fraenkel axiomaticsettheoryplusaxiomofchoice),isconsideredtobethefoundationofmath- ematics for most mathematicians nowadays. Unfortunately, some interesting theo- rems are independent from ZFC (i.e., neither these theorems nor their negative can be proved in ZFC). One example is continuum hypothesis (CH) proposed by Cantor which states that there is no cardinal number between and . The independence of CH is proved by Gdel (ZFC CH is consistent if ZFC is consistent) and Cohen (ZFC CH is also consistent if ZFC is consistent). Due to this situation, a large number of mathematicians try to find some new axioms