Reverse Mathematics and Fully Ordered Groups. - Reed Solomon (Notre Dame J. Formal Log., 1998)

Ordered groups: a case study in reverse mathematics. - Reed Solomon (Bull. Symb. Log., 1999)

On the filter of computably enumerable supersets of an r-maximal set. - Steffen Lempp; André Nies; Reed Solomon (Arch. Math. Log., 2001)

A delta02 Set with No Infinite Low Subset in Either It or Its Complement. - Rodney G. Downey; Denis R. Hirschfeldt; Steffen Lempp; Reed Solomon (J. Symb. Log., 2001)

PI11-CA0 and Order Types of Countable Ordered Groups. - Reed Solomon (J. Symb. Log., 2001)

Pi10 classes and orderable groups. - Reed Solomon (Ann. Pure Appl. Log., 2002)

The Lindenbaum Algebra of the Theory of the class of All finite Models. - Steffen Lempp; Mikhail G. Peretyat'kin; Reed Solomon (J. Math. Log., 2002)

Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order. - Steffen Lempp; Charles F. D. McCoy; Andrei S. Morozov; Reed Solomon (Order, 2002)

Effectiveness for infinite variable words and the Dual Ramsey Theorem. - Joseph S. Miller; Reed Solomon (Arch. Math. Log., 2004)

Reverse mathematics and the equivalence of definitions for well and better quasi-orders. - Peter Cholak; Alberto Marcone; Reed Solomon (J. Symb. Log., 2004)

Enumerations in computable structure theory. - Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy; Russell G. Miller; Reed Solomon (Ann. Pure Appl. Log., 2005)

Computable categoricity of trees of finite height. - Steffen Lempp; Charles F. D. McCoy; Russell G. Miller; Reed Solomon (J. Symb. Log., 2005)

A computably stable structure with no Scott family of finitary formulas. - Peter Cholak; Richard A. Shore; Reed Solomon (Arch. Math. Log., 2006)

On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. - Stephen Binns; Bjørn Kjos-Hanssen; Manuel Lerman; Reed Solomon (J. Symb. Log., 2006)

Self-Embeddings of Computable Trees. - Stephen Binns; Bjørn Kjos-Hanssen; Manuel Lerman; James H. Schmerl; Reed Solomon (Notre Dame J. Formal Log., 2008)

Stability and posets. - Carl G. Jockusch Jr.; Bart Kastermans; Steffen Lempp; Manuel Lerman; Reed Solomon (J. Symb. Log., 2009)

Embeddings of Computable Structures. - Asher M. Kach; Oscar Levin; Reed Solomon (Notre Dame J. Formal Log., 2010)

The complexity of central series in nilpotent computable groups. - Barbara F. Csima; Reed Solomon (Ann. Pure Appl. Log., 2011)

Lowness notions, measure and domination. - Bjørn Kjos-Hanssen; Joseph S. Miller; Reed Solomon (J. Lond. Math. Soc., 2012)

Jump degrees of torsion-free abelian groups. - Brooke M. Andersen; Asher M. Kach; Alexander G. Melnikov; Reed Solomon (J. Symb. Log., 2012)

Reverse mathematics and infinite traceable graphs. - Peter Cholak; David J. Galvin; Reed Solomon (Math. Log. Q., 2012)

Local Computability for Ordinals. - Johanna N. Y. Franklin; Asher M. Kach; Russell G. Miller; Reed Solomon (CiE, 2013)

Degrees of orders on torsion-free Abelian groups. - Asher M. Kach; Karen M. Lange; Reed Solomon (Ann. Pure Appl. Log., 2013)

Separating Principles below Ramsey's Theorem for Pairs. - Manuel Lerman; Reed Solomon; Henry Towsner (J. Math. Log., 2013)

On the Effectiveness of Symmetry Breaking. - Russell G. Miller; Reed Solomon; Rebecca M. Steiner (CiE, 2014)

Degrees that Are Low for Isomorphism. - Johanna N. Y. Franklin; Reed Solomon (Comput., 2014)

Computable Reductions and Reverse Mathematics. - Reed Solomon (CiE, 2016)

Effectiveness of Hindman's Theorem for Bounded Sums. - Damir D. Dzhafarov; Carl G. Jockusch Jr.; Reed Solomon; Linda Brown Westrick (Computability and Complexity, 2017)

The uniform content of partial and linear orders. - Eric P. Astor; Damir D. Dzhafarov; Reed Solomon; Jacob Suggs (Ann. Pure Appl. Log., 2017)

The reverse mathematics of Hindman's Theorem for sums of exactly two elements. - Barbara F. Csima; Damir D. Dzhafarov; Denis R. Hirschfeldt; Carl G. Jockusch Jr.; Reed Solomon; Linda Brown Westrick (Comput., 2019)

The determined Property of Baire in Reverse Math. - Eric P. Astor; Damir D. Dzhafarov; Antonio Montalbán; Reed Solomon; Linda Brown Westrick (J. Symb. Log., 2020)

Lowness for isomorphism, countable ideals, and computable traceability. - Johanna N. Y. Franklin; Reed Solomon (Math. Log. Q., 2020)

Model completeness and relative decidability. - Jennifer Chubb; Russell G. Miller; Reed Solomon (Arch. Math. Log., 2021)

Effectiveness for the Dual Ramsey Theorem. - Damir D. Dzhafarov; Stephen Flood; Reed Solomon; Linda Brown Westrick (Notre Dame J. Formal Log., 2021)

On the isomorphism problem for some classes of computable algebraic structures. - Valentina S. Harizanov; Steffen Lempp; Charles F. D. McCoy; Andrei S. Morozov; Reed Solomon (Arch. Math. Log., 2022)

On the first-order parts of problems in the Weihrauch degrees. - Damir D. Dzhafarov; Reed Solomon; Keita Yokoyama (Comput., 2024)