1. J. Avigad, E. T. Dean and J. Rute, Algorithmic randomness, reverse mathematics, and the dominated convergence theorem, Ann. Pure Appl. Logic 163 (2012), 1854–1864.
2. L. Bienvenu, L. Patey and P. Shafer, On the logical strengths of partial solutions to mathematical problems, ArXiv e-prints (2014).
3. A. Bovykin and A. Weiermann, The strength of infinitary Ramseyan principles can be accessed by their densities, Ann. Pure Appl. Logic, to appear (2005).
4. V. Brattka and T. Rakotoniaina, On the Uniform Computational Content of Ramsey’s Theorem, ArXiv e-prints (2015).
5. P. A. Cholak, M. Giusto, J. L. Hirst and C. G. Jockusch, Free sets and reverse mathematics, in Reverse mathematics 2001, Lect. Notes Log., Vol. 21, Assoc. Symbol. Logic, La Jolla, CA, 2005, pp. 104–119.