Weak Comparability of Well Orderings and Reverse Mathematics. - Harvey Friedman; Jeffry L. Hirst (Ann. Pure Appl. Log., 1990)

Reverse Mathematics and Homeomorphic Embeddings. - Harvey Friedman; Jeffry L. Hirst (Ann. Pure Appl. Log., 1991)

Connected components of graphs and reverse mathematics. - Jeffry L. Hirst (Arch. Math. Log., 1992)

Embeddings of countable closed sets and reverse mathematics. - Jeffry L. Hirst (Arch. Math. Log., 1993)

Derived Sequences and Reverse Mathematics. - Jeffry L. Hirst (Math. Log. Q., 1993)

Reverse Mathematics and Ordinal Exponentiation. - Jeffry L. Hirst (Ann. Pure Appl. Log., 1994)

Infinite Versions of Some Problems From Finite Complexity Theory. - Jeffry L. Hirst; Steffen Lempp (Notre Dame J. Formal Log., 1996)

Reverse Mathematics and Recursive Graph Theory. - William I. Gasarch; Jeffry L. Hirst (Math. Log. Q., 1998)

Reverse Mathematics and Ordinal Multiplication. - Jeffry L. Hirst (Math. Log. Q., 1998)

Reverse mathematics of prime factorization of ordinals. - Jeffry L. Hirst (Arch. Math. Log., 1999)

Ordinal Inequalities, Transfinite Induction, and Reverse Mathematics. - Jeffry L. Hirst (J. Symb. Log., 1999)

Reverse mathematics and rank functions for directed graphs. - Jeffry L. Hirst (Arch. Math. Log., 2000)

Hindman's theorem, ultrafilters, and reverse mathematics. - Jeffry L. Hirst (J. Symb. Log., 2004)

Minima of initial segments of infinite sequences of reals. - Jeffry L. Hirst (Math. Log. Q., 2004)

Reverse mathematics of separably closed sets. - Jeffry L. Hirst (Arch. Math. Log., 2006)

Combinatorics and Graph Theory, Second Edition. - John M. Harris; Jeffry L. Hirst; Michael J. Mossinghoff (Springer, 2008)

Partitions of trees and ACA'0. - Bernard A. Anderson; Jeffry L. Hirst (Arch. Math. Log., 2009)

The polarized Ramsey's theorem. - Damir D. Dzhafarov; Jeffry L. Hirst (Arch. Math. Log., 2009)

Reverse mathematics, computability, and partitions of trees. - Jennifer Chubb; Jeffry L. Hirst; Timothy H. McNicholl (J. Symb. Log., 2009)

Ramsey's theorem for trees: the polarized tree theorem and notions of stability. - Damir D. Dzhafarov; Jeffry L. Hirst; Tamara J. Lakins (Arch. Math. Log., 2010)

Reverse Mathematics and Uniformity in Proofs without Excluded Middle. - Jeffry L. Hirst; Carl Mummert (Notre Dame J. Formal Log., 2011)

On Mathias Generic Sets. - Peter Cholak; Damir D. Dzhafarov; Jeffry L. Hirst (CiE, 2012)

Hilbert versus Hindman. - Jeffry L. Hirst (Arch. Math. Log., 2012)

Reverse mathematics, trichotomy, and dichotomy. - François G. Dorais; Jeffry L. Hirst; Paul Shafer (J. Log. Anal., 2012)

More reverse mathematics of the Heine-Borel Theorem. - Jeffry L. Hirst; Jessica Miller (J. Log. Anal., 2012)

Reverse Mathematics and Algebraic Field Extensions. - François G. Dorais; Jeffry L. Hirst; Paul Shafer (Comput., 2013)

Generics for computable Mathias forcing. - Peter Cholak; Damir D. Dzhafarov; Jeffry L. Hirst; Theodore A. Slaman (Ann. Pure Appl. Log., 2014)

Reverse mathematics and marriage problems with unique solutions. - Jeffry L. Hirst; Noah A. Hughes (Arch. Math. Log., 2015)

Denis R. Hirschfeldt. Slicing the truth: On the computable and reverse mathematics of combinatorial principles. Lecture Note Series, Institute for Mathematical Sciences, National University of Singapore, vol. 28. World Scientific Publishing Co. Pte. Ltd., Singapore, 2015, xiv+214 pp. - Jeffry L. Hirst (Bull. Symb. Log., 2015)

On the existence of a connected component of a graph. - Kirill Gura; Jeffry L. Hirst; Carl Mummert (Comput., 2015)

Comparing the strength of diagonally Nonrecursive Functions in the Absence of ∑20 Induction. - François G. Dorais; Jeffry L. Hirst; Paul Shafer (J. Symb. Log., 2015)

Reverse mathematics and marriage problems with finitely many solutions. - Jeffry L. Hirst; Noah A. Hughes (Arch. Math. Log., 2016)

Reverse Mathematics of Matroids. - Jeffry L. Hirst; Carl Mummert (Computability and Complexity, 2017)

J. Stillwell, Reverse Mathematics: Proofs from the Inside Out, Princeton University Press, Princeton, 2018, xiii + 182 pp. - Jeffry L. Hirst (Bull. Symb. Log., 2018)

Reverse mathematics and colorings of hypergraphs. - Caleb Davis; Jeffry L. Hirst; Jake Pardo; Tim Ransom (Arch. Math. Log., 2019)

Using Ramsey's theorem once. - Jeffry L. Hirst; Carl Mummert (Arch. Math. Log., 2019)

Combinatorial principles equivalent to weak induction. - Caleb Davis; Denis R. Hirschfeldt; Jeffry L. Hirst; Jake Pardo; Arno Pauly; Keita Yokoyama (Comput., 2020)

Leaf management. - Jeffry L. Hirst (Comput., 2020)

Reverse mathematics and Weihrauch analysis motivated by finite complexity theory. - Zach BeMent; Jeffry L. Hirst; Asuka Wallace (Comput., 2021)

Banach's theorem in higher-order reverse mathematics. - Jeffry L. Hirst; Carl Mummert (Comput., 2023)