Reed Solomon

Orcid: 0000-0001-7574-204X

Affiliations:
  • University of Connecticut, Department of Mathematics, Storrs, CT, USA


According to our database1, Reed Solomon authored at least 35 papers between 1998 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On the isomorphism problem for some classes of computable algebraic structures.
Arch. Math. Log., 2022

2021
Effectiveness for the Dual Ramsey Theorem.
Notre Dame J. Formal Log., 2021

Model completeness and relative decidability.
Arch. Math. Log., 2021

2020
Lowness for isomorphism, countable ideals, and computable traceability.
Math. Log. Q., 2020

The determined Property of Baire in Reverse Math.
J. Symb. Log., 2020

2019
The reverse mathematics of Hindman's Theorem for sums of exactly two elements.
Comput., 2019

2017
The uniform content of partial and linear orders.
Ann. Pure Appl. Log., 2017

Effectiveness of Hindman's Theorem for Bounded Sums.
Proceedings of the Computability and Complexity, 2017

2016
Computable Reductions and Reverse Mathematics.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2014
Degrees that Are Low for Isomorphism.
Comput., 2014

On the Effectiveness of Symmetry Breaking.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Separating Principles below Ramsey's Theorem for Pairs.
J. Math. Log., 2013

Degrees of orders on torsion-free Abelian groups.
Ann. Pure Appl. Log., 2013

Local Computability for Ordinals.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Reverse mathematics and infinite traceable graphs.
Math. Log. Q., 2012

Jump degrees of torsion-free abelian groups.
J. Symb. Log., 2012

Lowness notions, measure and domination.
J. Lond. Math. Soc., 2012

2011
The complexity of central series in nilpotent computable groups.
Ann. Pure Appl. Log., 2011

2010
Embeddings of Computable Structures.
Notre Dame J. Formal Log., 2010

2009
Stability and posets.
J. Symb. Log., 2009

2008
Self-Embeddings of Computable Trees.
Notre Dame J. Formal Log., 2008

2006
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination.
J. Symb. Log., 2006

A computably stable structure with no Scott family of finitary formulas.
Arch. Math. Log., 2006

2005
Computable categoricity of trees of finite height.
J. Symb. Log., 2005

Enumerations in computable structure theory.
Ann. Pure Appl. Log., 2005

2004
Reverse mathematics and the equivalence of definitions for well and better quasi-orders.
J. Symb. Log., 2004

Effectiveness for infinite variable words and the Dual Ramsey Theorem.
Arch. Math. Log., 2004

2002
Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order.
Order, 2002

The Lindenbaum Algebra of the Theory of the class of All finite Models.
J. Math. Log., 2002

Pi<sub>1</sub><sup>0</sup> classes and orderable groups.
Ann. Pure Appl. Log., 2002

2001
PI<sup>1</sup><sub>1</sub>-CA<sub>0</sub> and Order Types of Countable Ordered Groups.
J. Symb. Log., 2001

A delta<sup>0</sup><sub>2</sub> Set with No Infinite Low Subset in Either It or Its Complement.
J. Symb. Log., 2001

On the filter of computably enumerable supersets of an r-maximal set.
Arch. Math. Log., 2001

1999
Ordered groups: a case study in reverse mathematics.
Bull. Symb. Log., 1999

1998
Reverse Mathematics and Fully Ordered Groups.
Notre Dame J. Formal Log., 1998


  Loading...