- Notre Dame Journal of Formal Logic Self-embeddings of computable trees
- 1 -CA0 and Order Types of Countable Ordered Groups Reed Solomon
- EMBEDDING FINITE LATTICES INTO THE COMPUTABLY ENUMERABLE DEGREES --
- On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
- The Lindenbaum algebra of the theory of the class of all nite models
- Ordering Free Products in Reverse Mathematics Reed Solomon
- Group theoretic properties of the group of computable automorphisms
- REVERSE MATHEMATICS, ARCHIMEDEAN CLASSES, AND HAHN'S RODNEY G. DOWNEY AND REED SOLOMON
- Ordered Groups: A Case Study In Reverse Mathematics
- Contemporary Mathematics Thin classes of separating sets
- The complexity of central series in nilpotent computable Barbara F. Csima
- CAPPABLE CEA SETS AND RAMSEY'S THEOREM ASHER M. KACH, MANUEL LERMAN, AND REED SOLOMON
- EMBEDDINGS OF COMPUTABLE STRUCTURES ASHER M. KACH, OSCAR LEVIN, AND REED SOLOMON
- Enumerations in computable structure theory Sergey Goncharov
- Computable Categoricity of Trees of Finite Height Steffen Lempp
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- EFFECTIVENESS FOR INFINITE VARIABLE WORDS AND THE DUAL RAMSEY THEOREM
- The computable dimension of ordered abelian groups
- Reverse Mathematics of the Nielsen-Schreier Theorem Rodney G. Downey
- Reverse mathematics and fully ordered groups Reed Solomon
- Ordering Free Products in Reverse Math-Reed Solomon
- JUMP DEGREES OF TORSION-FREE ABELIAN GROUPS BROOKE M. ANDERSEN, ASHER M. KACH, ALEXANDER G. MELNIKOV,
- DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON
