Avigad, Jeremy, [1996], Formalizing forcing arguments in subsystems of second-order arithmetic, Annals of Pure and Applied Logic, vol. 82, no. 2, pp. 165–191.

Downey, R., Hirschfeldt, Denis R., Lempp, S., and Solomon, R., [to appear], *A Δ*_{2}^{0} set withno infinite low set in either it or its complement, this Journal.

Fairtlough, Matt and Wainer, Stanley S. [1998], Hierarchies of provably recursive functions, Handbook of proof theory, Studies in Logic and the Foundations of Mathematics, vol. 137, North-Holland, Amsterdam.

Friedman, Harvey, [1975], Some systems of second order arithmetic and their use, Proceedings of the international congress of mathematicians (Vancouver, B.C., 1974), vol. 1, Canadian Mathematical Congress, Montreal, Quebec, pp. 235–242.

Friedman, Harvey, [1976], Systems of second order arithmetic with restricted induction, I, II (abstracts), this Journal, vol. 41, pp. 557–559.

Graham, Ronald L., Rothschild, Bruce L., and Spencer, Joel H. [1990], Ramsey theory, second ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York, A Wiley-Interscience Publication.

Hájek, Petr, [1993], Interpretability and fragments of arithmetic, Arithmetic, proof theory, and computational complexity (Prague, 1991), Oxford Univ. Press, New York, pp. 185–196.

Hájek, Petr and Pudlák, Pavel, [1993], Metamathematics of first-order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin.

Herrmann, E., [to appear], *Infinite chains and antichains in recursive partial orderings*, this Journal.

Hirst, Jeffry L., [1987], Combinatorics in Subsystems of Second Order Arithmetic, *Ph.D. thesis*, The Pennsylvania State University.

Hummel, Tamara Lakins, [1994], Effective versions of Ramsey's theorem: Avoiding the cone above 0′, this Journal, vol. 59, pp. 1301–1325.

Hummel, Tamara Lakins and Jockusch, Carl G. Jr. [1999], Generalized cohesiveness, this Journal, vol. 64, pp. 489–516.

Jockusch, Carl G. Jr. [1968], Semirecursive sets and positive reducibility, Transactions of the American Mathematical Society, vol. 131, pp. 420–436.

Jockusch, Carl G. Jr. [1972], Ramsey's theorem and recursion theory, this Journal, vol. 37, pp. 268–280.

Jockusch, Carl G. Jr. [1973], Upward closure and cohesive degrees, Israel Journal of Mathematics, vol. 15, pp. 332–335.

Jockusch, Carl G. Jr., and Soare, Robert I., [1972], Π_{1}^{0} classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173, pp. 33–56.

Jockusch, Carl G. Jr. and Stephan, Frank [1993], A cohesive set which is not high, Mathematical Logic Quarterly, vol. 39, pp. 515–530.

Jockusch, Carl G. Jr. and Stephan, Frank [1997], Correction to “A cohesive set which isnothigh”, Mathematical Logic Quarterly, vol. 43, p. 569.

Kaye, Richard, [1991], Models of Peano arithmetic, Oxford Logic Guides, vol. 15, The Clarendon Press Oxford University Press, New York, Oxford Science Publications.

Mints, G. E. [1973], Quantifer-free and one quantifier systems, Journal of Soviet Mathematics, vol. 1, pp. 71–84.

Mytilinaios, Michael E. and Slaman, Theodore A. [1996], On a question of Brown and Simpson, Computability, enumerability, unsolvability, directions in recursion theory (Cooper, S. B., Slaman, T. A., and Wainer, S. S., editors), Cambridge University Press, Cambridge, UK, pp. 205–218.

Odifreddi, Piergiorgio, [1989], Classical recursion theory (volume I), North-Holland Publishing Co., Amsterdam.

Paris, J. B., [1980], A hierarchy of cuts in models of arithmetic, Model theory of algebra and arithmetic (Proceedigs, Karpacz, Poland 1979), Lecture Notes in Mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, New York, pp. 312–337.

Parsons, Charles, [1970], On a number theoretic choice schema and its relation to induction, Intuitionism and proof theory (Proceedings of a Conference, Buffalo, N.Y., 1968), North-Holland, Amsterdam, pp. 459–473.

Posner, David B. and Robinson, Robert W., [1981], Degrees joining to 0′, this Journal, vol. 46, no. 4, pp. 714–722.

Ramsey, F. P., [1930], On a problem informal logic, Proceedings of London Mathematical Society (3), vol. 30, pp. 264–286.

Scott, Dana, [1962], Algebras of sets binumerable in complete extensions of arithmetic, Recursive function theory (Providence, R.I.), Proceedings of Symposia in Pure Mathematics, no. 5, American Mathematical Society, pp. 117–121.

Seetapun, David and Slaman, Theodore A., [1995], On the strength of Ramsey's theorem, Notre Dame Journal of Formal Logic, vol. 36, no. 4, pp. 570–582, Special Issue: Models of arithmetic.

Simpson, Stephen G., [1977], Degrees of unsolvability: a survey of results, Handbook of mathematical logic (Barwise, Jon, editor), North-Holland, Amsterdam, pp. 1133–1142.

Simpson, Stephen G., [1999], Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, XIV + 445 pages.

Soare, Robert I., [1987], Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Heidelberg.

Specker, E., [1971], Ramsey's Theorem does not hold in recursive set theory, Logic Colloquium; 1969 Manchester, pp. 439–442.

Spector, C., [1956], On the degrees of recursive unsolvability, Annals of Mathematics (2), vol. 64, pp. 581–592.

Takeuti, Gaisi, [1987], Proof theory, second ed., Studies in Logic and the Foundations of Mathematics, vol. 81, North-Holland Publishing Co., Amsterdam, With an appendix containing contributions by Georg Kreisel, Wolfram Pohlers, Stephen G. Simpson and Solomon Feferman.