Several notions of computability theoretic reducibility between Π12 principles have been studied. This paper contributes to the program of analyzing the behavior of versions of Ramsey’s Theorem and related principles under these notions. Among other results, we show that for each n> 3, there is an instance of RTn2 all of whose so-lutions have PA degree over ∅(n−2), and use this to show that König’s Lemma lies strictly between RT22 and RT 3 2 under one of these notions. We also answer two questions raised by Dorais, Dzhafarov, Hirst, Mileti, and Shafer [ta] on comparing versions of Ramsey’s Theorem and of the Thin Set Theorem with the same exponent but different numbers of colors. Still on the topic of the effect of the number of colors on the computable aspects of Ramsey theoretic properties, we show that for each m> 2, there is an (m + 1)-coloring c of N such

In this expository article, we discuss two closely related approaches to studying the relative strength of mathematical principles: computable mathematics and reverse mathematics. Drawing our examples from combinatorics and model theory, we explore a variety of phenomena and techniques in these areas. We begin with variations on König’s Lemma, and give an introduction to reverse mathematics and related parts of computability theory. We then focus on Ramsey’s Theorem as a case study in the computability theoretic and reverse mathematical analysis of com-binatorial principles. We study Ramsey’s Theorem for Pairs (RT22) in detail, focusing on fundamental tools such as stability, cohesiveness, and Mathias forcing; and on combinatorial and model theoretic consequences of RT22. We also discuss the important theme of conservativity results. In the final section, we explore several topics that reveal various aspects of computable mathematics and reverse mathematics. An appendix con-tains a proof of Liu’s recent result that RT22 does not imply Weak König’s Lemma. There are exercises and open questions throughout the article.