Please use this identifier to cite or link to this item:
|Title:||Π11-conservation of combinatorial principles weaker than Ramsey's theorem for pairs||Authors:||Chong, C.T.
|Issue Date:||20-Jun-2012||Citation:||Chong, C.T., Slaman, T.A., Yang, Y. (2012-06-20). Π11-conservation of combinatorial principles weaker than Ramsey's theorem for pairs. Advances in Mathematics 230 (3) : 1060-1077. ScholarBank@NUS Repository. https://doi.org/10.1016/j.aim.2012.02.025||Abstract:||We study combinatorial principles weaker than Ramsey's theorem for pairs over the RCA 0 (recursive comprehension axiom) system with σ20-bounding. It is shown that the cohesiveness (COH), ascending and descending sequence (ADS), and chain/antichain (CAC) principles are all Π11-conservative over σ20-bounding. In particular, none of these principles proves σ20-induction. © 2012 Elsevier Ltd.||Source Title:||Advances in Mathematics||URI:||http://scholarbank.nus.edu.sg/handle/10635/104487||ISSN:||00018708||DOI:||10.1016/j.aim.2012.02.025|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.