The weakness of being cohesive, thin or free in reverse mathematics

Ludovic Patey 1, 2
2 PI.R2 - Design, study and implementation of languages for proofs and programs
Inria de Paris, CNRS - Centre National de la Recherche Scientifique, UPD7 - Université Paris Diderot - Paris 7, PPS - Preuves, Programmes et Systèmes
Abstract : Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse mathematics and computable reducibility. To this end, we study the degrees of unsolvability of cohesive sets for different uniformly computable sequence of sets and identify different layers of unsolvability. This analysis enables us to answer some questions of Wang about how typical sets help computing cohesive sets. We also study the impact of the number of colors in the computable reducibility between coloring statements. In particular, we strengthen the proof by Dzhafarov that cohesiveness does not strongly reduce to stable Ramsey's theorem for pairs, revealing the combinatorial nature of this non-reducibility and prove that whenever k is greater than , stable Ramsey's theorem for n-tuples and k colors is not computably reducible to Ramsey's theorem for n-tuples and colors. In this sense, Ramsey's theorem is not robust with respect to his number of colors over computable reducibility. Finally, we separate the thin set and free set theorem from Ramsey's theorem for pairs and identify an infinite decreasing hierarchy of thin set theorems in reverse mathematics. This shows that in reverse mathematics, the strength of Ramsey's theorem is very sensitive to the number of colors in the output set. In particular, it enables us to answer several related questions asked by Cholak, Giusto, Hirst and Jockusch.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01888606
Contributor : Ludovic Patey <>
Submitted on : Friday, October 5, 2018 - 11:13:31 AM
Last modification on : Friday, January 4, 2019 - 5:33:38 PM
Document(s) archivé(s) le : Sunday, January 6, 2019 - 2:23:58 PM

File

weakness-coh.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Ludovic Patey. The weakness of being cohesive, thin or free in reverse mathematics. Israël Journal of Mathematics, The Hebrew University Magnes Press, 2016, 216 (2), pp.905 - 955. ⟨10.1007/s11856-016-1433-3⟩. ⟨hal-01888606⟩

Share

Metrics

Record views

14

Files downloads

21