1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.aim.2012.02.025
DC FieldValue
dc.titleΠ11-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
dc.contributor.authorChong, C.T.
dc.contributor.authorSlaman, T.A.
dc.contributor.authorYang, Y.
dc.date.accessioned2014-10-28T02:49:56Z
dc.date.available2014-10-28T02:49:56Z
dc.date.issued2012-06-20
dc.identifier.citationChong, 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
dc.identifier.issn00018708
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104487
dc.description.abstractWe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.aim.2012.02.025
dc.sourceScopus
dc.subjectΠ11-conservation
dc.subjectσ20-bounding
dc.subjectAscending/descending sequence
dc.subjectChain/antichain
dc.subjectCohesiveness
dc.subjectCombinatorial principles
dc.subjectRCA 0
dc.subjectReverse mathematics
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.aim.2012.02.025
dc.description.sourcetitleAdvances in Mathematics
dc.description.volume230
dc.description.issue3
dc.description.page1060-1077
dc.identifier.isiut000304386400012
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.