Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Reed Solomon
2010 – today
- 2013
[j21]Asher M. Kach, Karen Lange, Reed Solomon: Degrees of orders on torsion-free Abelian groups. Ann. Pure Appl. Logic 164(7-8): 822-836 (2013)- [c1]Johanna N. Y. Franklin, Asher M. Kach, Russell Miller, Reed Solomon: Local Computability for Ordinals. CiE 2013: 161-170
- 2012
- [j20]Bjørn Kjos-Hanssen, Joseph S. Miller, Reed Solomon: Lowness notions, measure and domination. J. London Math. Society 85(3): 869-888 (2012)
- [j19]Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov, Reed Solomon: Jump degrees of torsion-free abelian groups. J. Symb. Log. 77(4): 1067-1100 (2012)
- [j18]Peter Cholak, David Galvin, Reed Solomon: Reverse mathematics and infinite traceable graphs. Math. Log. Q. 58(1-2): 18-28 (2012)
- 2011
- [j17]Barbara F. Csima, Reed Solomon: The complexity of central series in nilpotent computable groups. Ann. Pure Appl. Logic 162(8): 667-678 (2011)
- 2010
- [j16]Asher M. Kach, Oscar Levin, Reed Solomon: Embeddings of Computable Structures. Notre Dame Journal of Formal Logic 51(1): 55-68 (2010)
2000 – 2009
- 2009
- [j15]Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon: Stability and posets. J. Symb. Log. 74(2): 693-711 (2009)
- 2008
- [j14]Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon: Self-Embeddings of Computable Trees. Notre Dame Journal of Formal Logic 49(1): 1-37 (2008)
- 2006
- [j13]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)
- [j12]Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon: On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symb. Log. 71(1): 119-136 (2006)
- 2005
- [j11]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)
- [j10]Steffen Lempp, Charles F. D. McCoy, Russell Miller, Reed Solomon: Computable categoricity of trees of finite height. J. Symb. Log. 70(1): 151-215 (2005)
- 2004
- [j9]Joseph S. Miller, Reed Solomon: Effectiveness for infinite variable words and the Dual Ramsey Theorem. Arch. Math. Log. 43(4): 543-556 (2004)
- [j8]Peter Cholak, Alberto Marcone, Reed Solomon: Reverse mathematics and the equivalence of definitions for well and better quasi-orders. J. Symb. Log. 69(3): 683-712 (2004)
- 2002
- [j7]
- [j6]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
- [j5]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)
- [j4]Reed Solomon: PI11-CA0 and Order Types of Countable Ordered Groups. J. Symb. Log. 66(1): 192-206 (2001)
- [j3]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)
1990 – 1999
- 1999
- [j2]Reed Solomon: Ordered groups: a case study in reverse mathematics. Bulletin of Symbolic Logic 5(1): 45-58 (1999)
- 1998
- [j1]Reed Solomon: Reverse Mathematics and Fully Ordered Groups. Notre Dame Journal of Formal Logic 39(2): 157-189 (1998)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-05 21:26 CEST by the dblp team