This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
Jeremy Avigad , , Formalizing forcing arguments in subsystems of second-order arithmetic, Annals of Pure and Applied Logic, vol. 82, no. 2, pp. 165–191.
Matt Fairtlough and Stanley S. Wainer , Hierarchies of provably recursive functions, Handbook of proof theory, Studies in Logic and the Foundations of Mathematics, vol. 137, North-Holland, Amsterdam.
Ronald L. Graham , Bruce L. Rothschild , and Joel H. Spencer , Ramsey theory, second ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York, A Wiley-Interscience Publication.
Petr Hájek and Pavel Pudlák , , Metamathematics of first-order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin.
Carl G. Jockusch Jr. , Semirecursive sets and positive reducibility, Transactions of the American Mathematical Society, vol. 131, pp. 420–436.
Carl G. Jockusch Jr. , Upward closure and cohesive degrees, Israel Journal of Mathematics, vol. 15, pp. 332–335.
Carl G. Jockusch Jr., and Robert I. Soare , , Π10 classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173, pp. 33–56.
Carl G. Jockusch Jr. and Frank Stephan , A cohesive set which is not high, Mathematical Logic Quarterly, vol. 39, pp. 515–530.
Carl G. Jockusch Jr. and Frank Stephan , Correction to “A cohesive set which isnothigh”, Mathematical Logic Quarterly, vol. 43, p. 569.
G. E. Mints , Quantifer-free and one quantifier systems, Journal of Soviet Mathematics, vol. 1, pp. 71–84.
J. B. Paris , , 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.
Charles Parsons , , 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.
Dana Scott , , 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.
Robert I. Soare , , Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Heidelberg.
C. Spector , , On the degrees of recursive unsolvability, Annals of Mathematics (2), vol. 64, pp. 581–592.