Free sets and reverse mathematics, Reverse mathematics, vol.21, pp.104-119, 2001. ,
On the strength of Ramsey's theorem for pairs, Journal of Symbolic Logic, vol.66, issue.01, pp.1-55, 2001. ,
Thin set theorems and cone avoidance, 2019. ,
The strength of the rainbow Ramsey theorem, Journal of Symbolic Logic, vol.74, issue.04, pp.1310-1324, 2009. ,
RELATIONSHIPS BETWEEN COMPUTABILITY?THEORETIC PROPERTIES OF PROBLEMS, The Journal of Symbolic Logic, pp.1-26, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02118608
Ramsey's theorem and cone avoidance, Journal of Symbolic Logic, vol.74, issue.2, pp.557-578, 2009. ,
New publications available fom NINR, Nursing Outlook, vol.42, issue.5, p.242, 1994. ,
HIGHER RANDOMNESS AND GENERICITY, Forum of Mathematics, Sigma, vol.5, 2017. ,
Ramsey's theorem and recursion theory, Journal of Symbolic Logic, vol.37, issue.2, pp.268-280, 1972. ,
? 0 1 classes and degrees of theories, Transactions of the American Mathematical Society, vol.173, pp.33-56, 1972. ,
Combinatorial principles between RRT 2 2 and RT 2 2, Frontiers of Mathematics in China, vol.9, issue.6, pp.1309-1323, 2014. ,
RT22 does not imply WKL0, The Journal of Symbolic Logic, vol.77, issue.2, pp.609-620, 2012. ,
Cone avoiding closed sets, Transactions of the American Mathematical Society, vol.367, issue.3, pp.1609-1630, 2014. ,
Higher computability and randomness, 2014. ,
Pigeons do not jump high, Advances in Mathematics, vol.352, pp.1066-1095, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01888793
Combinatorial weaknesses of Ramseyan principles, 2015. ,
Somewhere over the rainbow Ramsey theorem for pairs, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01888807
OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, The Bulletin of Symbolic Logic, vol.22, issue.2, pp.151-169, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01888620
The weakness of being cohesive, thin or free in reverse mathematics, Israel Journal of Mathematics, vol.216, issue.2, pp.905-955, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01888606
Iterative forcing and hyperimmunity in reverse mathematics, Computability, vol.6, issue.3, pp.209-221, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01888601
The Thin Set Theorem for Pairs Implies DNR, Notre Dame Journal of Formal Logic, vol.56, issue.4, pp.595-601, 2015. ,
Measure-theoretic uniformity in recursion theory and set theory, Transactions of the American Mathematical Society, vol.142, pp.381-420, 1969. ,
Higher recursion theory. Perspectives in Mathematical Logic, 1990. ,
On the Strength of Ramsey's Theorem, Notre Dame Journal of Formal Logic, vol.36, issue.4, pp.570-582, 1995. ,
Subsystems of Second Order Arithmetic, 2009. ,
Recursive well-orderings, Journal of Symbolic Logic, vol.20, issue.2, pp.151-163, 1955. ,
, Nihon Ika Daigaku Igakkai Zasshi, vol.8, issue.2, pp.127-133, 2012.
Some reverse mathematics of rainbow Ramsey theorems ,
Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom, The Journal of Symbolic Logic, vol.78, issue.3, pp.824-836, 2013. ,
Cohesive sets and rainbows, Annals of Pure and Applied Logic, vol.165, issue.2, pp.389-408, 2014. ,
THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES, The Journal of Symbolic Logic, vol.81, issue.4, pp.1531-1554, 2016. ,
Some logically weak Ramseyan theorems, Advances in Mathematics, vol.261, pp.1-25, 2014. ,