2006 |
10 | EE | Peter Cholak,
Richard A. Shore,
Reed Solomon:
A computably stable structure with no Scott family of finitary formulas.
Arch. Math. Log. 45(5): 519-538 (2006) |
2005 |
9 | EE | Sergei S. Goncharov,
Valentina S. Harizanov,
Julia F. Knight,
Charles F. D. McCoy,
Russell Miller,
Reed Solomon:
Enumerations in computable structure theory.
Ann. Pure Appl. Logic 136(3): 219-246 (2005) |
2004 |
8 | EE | Joseph S. Miller,
Reed Solomon:
Effectiveness for infinite variable words and the Dual Ramsey Theorem.
Arch. Math. Log. 43(4): 543-556 (2004) |
2002 |
7 | | Reed Solomon:
Pi10 classes and orderable groups.
Ann. Pure Appl. Logic 115(1-3): 279-302 (2002) |
6 | EE | Steffen Lempp,
Charles F. D. McCoy,
Andrei S. Morozov,
Reed Solomon:
Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order.
Order 19(4): 343-364 (2002) |
2001 |
5 | EE | Steffen Lempp,
André Nies,
Reed Solomon:
On the filter of computably enumerable supersets of an r-maximal set.
Arch. Math. Log. 40(6): 415-423 (2001) |
4 | | Reed Solomon:
PI11-CA0 and Order Types of Countable Ordered Groups.
J. Symb. Log. 66(1): 192-206 (2001) |
3 | | Rodney G. Downey,
Denis R. Hirschfeldt,
Steffen Lempp,
Reed Solomon:
A delta02 Set with No Infinite Low Subset in Either It or Its Complement.
J. Symb. Log. 66(3): 1371-1381 (2001) |
1999 |
2 | EE | Reed Solomon:
Ordered groups: a case study in reverse mathematics.
Bulletin of Symbolic Logic 5(1): 45-58 (1999) |
1998 |
1 | | Reed Solomon:
Reverse Mathematics and Fully Ordered Groups.
Notre Dame Journal of Formal Logic 39(2): 157-189 (1998) |