, Vasco Brattka. Bibliography on Weihrauch complexity

V. Brattka and T. Rakotoniaina, On the uniform computational content of Ramsey's theorem

A. Peter, D. D. Cholak, J. L. Dzhafarov, T. A. Hirst, and . Slaman, Generics for computable Mathias forcing, Ann. Pure Appl. Logic, vol.165, issue.9, pp.1418-1428, 2014.

A. Peter, D. D. Cholak, M. I. Dzhafarov, and . Soskova, Generics for Mathias forcing over general Turing ideals, Israel J. Math

A. Peter, C. G. Cholak, T. A. Jockusch, and . Slaman, On the strength of Ramsey's theorem for pairs, J. Symbolic Logic, vol.66, issue.1, pp.1-55, 2001.

C. T. Chong, S. Lempp, and Y. Yang, On the role of the collection principle for ? 0 2-formulas in second-order reverse mathematics, Proc. Amer. Math. Soc, vol.138, issue.3, pp.1093-1100, 2010.

G. François, D. D. Dorais, J. L. Dzhafarov, J. R. Hirst, P. Mileti et al., On uniform relationships between combinatorial problems, Trans. Amer. Math. Soc, vol.368, issue.2, pp.1321-1359, 2016.

D. Damir and . Dzhafarov, Cohesive avoidance and strong reductions, Proc. Amer. Math. Soc, vol.143, issue.2, pp.869-876, 2015.

D. Damir and . Dzhafarov, Strong reductions between combinatorial principles, J. Symbolic Logic

M. J. Groszek and T. A. Slaman, Moduli of computation

D. R. Hirschfeldt, Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles. Lecture notes series / Institute for Mathematical Sciences, 2014.

R. Denis, C. G. Hirschfeldt, and . Jockusch, On notions of computability theoretic reduction between ? 1 2 principles

R. Denis, R. A. Hirschfeldt, and . Shore, Combinatorial principles weaker than Ramsey's theorem for pairs, J. Symbolic Logic, vol.72, issue.1, pp.171-206, 2007.

J. L. Hirst, Combinatorics in Subsystems of Second Order Arithmetic, 1987.

C. Jockusch and F. Stephan, A cohesive set which is not high, Math. Logic Quart, vol.39, issue.4, pp.515-530, 1993.

M. Lerman, R. Solomon, and H. Towsner, Separating principles below Ramsey's theorem for pairs, J. Math. Log, vol.13, issue.2, p.44, 2013.

J. R. Mileti, Partition Theorems and Computability Theory, 2004.

L. Patey, The weakness of being cohesive, thin or free in reverse mathematics, Israel J. Math
URL : https://hal.archives-ouvertes.fr/hal-01888606

T. Rakotoniaina, The Computational Strength of Ramsey's Theorem, 2015.

R. A. Shore, Lecture notes on turing degrees, Computational Prospects of Infinity II: AII Graduate Summer School

G. Stephen and . Simpson, Subsystems of second order arithmetic. Perspectives in Logic, 2009.

A. Theodore, Y. Slaman, and . Yang, The metamathematics of stable Ramsey's theorem for pairs

R. I. Soare, Computability theory and applications. Theory and Applications of Computability

R. M. Solovay, Hyperarithmetically encodable sets, Trans. Amer. Math. Soc, vol.239, pp.99-122, 1978.
DOI : 10.2307/1997849
URL : http://www.ams.org/tran/1978-239-00/S0002-9947-1978-0491103-7/S0002-9947-1978-0491103-7.pdf

K. Weihrauch, The degrees of discontinuity of some translators between representations of the real numbers, 1992.