Papers and Preprints
Reed Solomon
Below is a list of my papers and preprints which are available online. Clicking on one of these links will take you to a pdf version of the paper.

Lowness for
isomorphism, countable ideals and computable traceability with
Johanna Franklin, submitted.

Roots of polynomials in fields of generalized
power series with Julia Knight and Karen Lange, submitted.

Model completeness and
relative decidability with Jennifer Chubb and Russell Miller,
submitted.

Effectiveness for the Dual Ramsey
theorem with Damir Dzhafarov, Stephen Flood and Linda Brown Westrick, submitted.

Minimal weak truth table degrees and computably enumerable Turing degrees with Rod Downey and Selwyn Ng, to appear in Memoirs of the AMS.

The determined property of Baire in reverse
mathematics with Eric Astor, Damir Dzhafarov, Antonio Montalban
and Linda Brown Westrick, to appear in the Journal of Symbolic Logic.

The reverse mathematics of Hindman's
theorem for sums of exactly two elements with Barbara Csima,
Damir Dzhafarov, Denis Hirschfeldt, Carl Jockusch and Linda Brown
Westrick, to appear in Computability.

The uniform content of partial and linear orders with Eric Astor, Damir Dzhafarov and Jacob Suggs, Annals of Pure and Applied Logic 168 (6), 2017, 11531171.

Effectiveness of Hindman's theorem for bounded sums with Damir Dzhafarov, Carl Jockusch and Brown Westrick, in "Computability and Complexity: Essays dedicated to Rod Downey on his 60th birthday", Lecture Notes in Computer Science 10010, 2017, 134142.

Ramsey's theorem for singletons and strong computable reductions, with Damir Dzhafarov, Ludovic Patey and Brown Westrick, Proceedings of the AMS 145 (3), 2017, 13431355.

Computable reductions and reverse math, in "Pursuit of the Universal: CiE 2016", Lecture Notes in Computer Science 9709, 2016, 182191.

On the effectiveness of symmetry breaking, with Russell Miller and Rebecca Steiner, in "Language, Life, Limits: 10th Conference of Computability in Europe CiE 2014", Lecture Notes in Computer Science 8493, 2014, 314323.

Degrees that are low for isomorphism, with Johanna Franklin, Computability 3 (2), 2014, 7389.

Separating principles below Ramsey's Theorem for Pairs, with Manny Lerman and Henry Towsner, Journal of Math Logic, 13 (2), 2013.

Local computability for ordinals, with Johanna Franklin, Asher Kach and Russell Miller, in "The Nature of Computation: 9th Conference of Computability in Europe, CiE 2013", Lecture Notes in Computer Science 7921, 2013, 161170.

Degrees of orders on torsionfree abelian groups, with Asher Kach and Karen Lange, Annals of Pure and Applied Logic 164 (78), 2013, 822836.

Jump degrees of torsion free abelian groups, with Brooke Andersen, Asher Kach and Alexander Melnikov, Journal of Symbolic Logic 77 (4), 2012, 10671100.

Reverse mathematics and infinite traceable graphs, with Peter Cholak and David Galvin, Math Logic Quarterly 58 (12), 2012, 1828.

Lowness notions, measure and domination with Bjørn KjosHanssen and Joe Miller, Journal of the London Mathematical Society 85 (3), 2012, 869888.

Cappable CEA sets and Ramsey's Theorem with Asher Kach and Manny Lerman, in "Proceedings of the 11th Asian Logic Conference", edited by Arai, Feng, Kim, Wu and Yang, World Scientific, 2012, 114127.

Ordering free products in reverse mathematics, in "Foundational Adventures: Essays in Honors of Harvey M. Friedman", edited by Neil Tennant, Templeton Press (online) and College Publications London, 2011.

The complexity of central series in nilpotent computable groups with Barbara Csima, Annals of Pure and Applied Logic 162 (8), 2011, 667678.

Embeddings of computable structures with Asher Kach and Oscar Levin, Notre Dame Journal of Formal Logic 51 (1), 2010, 5568.

Stability and posets with Carl Jockusch Jr., Bart Kastermans, Steffen Lempp and Manny Lerman, Journal of Symbolic Logic 74 (2), June 2009, 693711.

Selfembeddings of computable trees with Stephen Binns, Bjørn KjosHanssen, Manny Lerman and Jim Schmerl, Notre Dame Journal of Formal Logic 49 (1), 2008, 138.

On the computability theoretic complexity of trivial, strongly minimal models with Bakhadyr Khoussainov, Chris Laskowski and Steffen Lempp, Proceedings of the AMS 135 (11), November 2007, 37113721.

Thin classes of separating sets, in Advances in Logic: The North Texas Logic Conference, Contemporary Mathematics 425, edited by Gao, Jackson and Zhang, 2007, 6786.

Embedding finite lattices into the computably enumerable degrees  a status survey with Steffen Lempp and Manuel Lerman, in Logic Colloquium '02, edited by Chatzidakis, Koepke and Pohlers, AK Peters, 2006, 206229.

On a conjecture of Dobrinen and Simpson concerning almost everywhere domination with Stehpen Binns, Bjørn KjosHanssen and Manny Lerman, Journal of Symbolic Logic 71 (1), March 2006, 119136.

A computably stable structure with no Scott family of finitary formulas with Peter Cholak and Richard Shore, Archive for Mathematical Logic 45, 2006, 519538.

Enumerations in computable structure theory with Sergey Goncharov, Valentina Harizanov, Julia Knight, Charlie McCoy and Russell Miller, Annals of Pure and Applied Logic 136 (3), 2005, 219246.

Computable categoricity for trees of finite height with Steffen Lempp, Charlie McCoy and Russell Miller, Journal of Symbolic Logic 70 (1), March 2005, 151215.

Reverse mathematics, archimedean classes, and Hahn's Theorem with Rod Downey, "Reverse Mathematics 2001", edited by Stephen Simpson, AK Peters, 2005, 147163.

Reverse mathematics and the equivalence of definitions for well and better quasiorders with Peter Cholak and Alberto Marcone, Journal of Symbolic Logic 69 (3), September 2004, 683712.

Effectiveness for infinite variable words and the Dual Ramsey Theorem with Joe Miller, Archive for Mathematical Logic 43 (4) May 2004, 543555.

Computabilitytheoretic and prooftheoretic aspects of partial and linear orderings with Rod Downey, Denis Hirschfeldt and Steffen Lempp, Israel Journal of Mathematics 138, 2003, 271289.

The Lindenbaum algebra of the theory of the class of all finite models with Steffen Lempp and Mikhail Peretyat'kin, Journal of Mathematical Logic 2 (2), November 2002, 145225.

Pi^0_1 classes and orderable groups Annals of Pure and Applied Logic 115 (13), 2002, 279302.

The computable dimension of ordered abelian groups with Sergey Goncharov and Steffen Lempp, Advances in Mathematics 175, 2002, 102143.

Group theoretic properties of the group of all computable automorphisms of a countable dense linear order with Steffen Lempp, Charles McCoy, and Andrei Morozov, Order 19, 2002, 343364.

Reverse mathematics and the NielsenSchreier Theorem with Rod Downey, Denis Hirschfeldt and Steffen Lempp, in "Proceedings of the International Conference in Logic Honoring Ershov on his 60th Birthday and Maltsev on his 90th Birthday", edited by Goncharov, Novisibirsk 2002, 5971.

Friedberg numberings of families of ncomputably enumerable sets with Sergey Goncharov and Steffen Lempp, Algebra and Logic 41 (2), March 2002, 8186.

A Delta^0_2 set with no infinite low set is either it or its complement with Rod Downey, Denis Hirschfeldt and Steffen Lempp, Journal of Symbolic Logic 66 (3), September 2001, 13711381.

On the filter of computable enumerable supersets of an rmaximal set with Steffen Lempp and Andre Nies, Archive for Mathematical Logic 40 (6), August 2001, 415423.

Pi^1_1CA_0 and order types of countable ordered groups Journal of Symbolic Logic 66 (1), March 2001, 192206.

Ordered groups: a case study in reverse mathematics Bulletin of Symbolic Logic 5 (1), March 1999, 4558.

Reverse mathematics and ordered groups Notre Dame Journal of Formal Logic 39 (2), Spring 1998, 157189.