default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReed Solomon
Person information
- affiliation: University of Connecticut, Department of Mathematics, Storrs, CT, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Damir D. Dzhafarov
, Reed Solomon, Keita Yokoyama:
On the first-order parts of problems in the Weihrauch degrees. Comput. 13(3-4): 363-375 (2024)- 2022
- [j31]Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon:
On the isomorphism problem for some classes of computable algebraic structures. Arch. Math. Log. 61(5-6): 813-825 (2022) - 2021
- [j30]Jennifer Chubb, Russell G. Miller, Reed Solomon:
Model completeness and relative decidability. Arch. Math. Log. 60(6): 721-735 (2021) - [j29]Damir D. Dzhafarov, Stephen Flood, Reed Solomon, Linda Brown Westrick:
Effectiveness for the Dual Ramsey Theorem. Notre Dame J. Formal Log. 62(3) (2021) - 2020
- [j28]Eric P. Astor, Damir D. Dzhafarov, Antonio Montalbán, Reed Solomon, Linda Brown Westrick:
The determined Property of Baire in Reverse Math. J. Symb. Log. 85(1): 166-198 (2020) - [j27]Johanna N. Y. Franklin, Reed Solomon:
Lowness for isomorphism, countable ideals, and computable traceability. Math. Log. Q. 66(1): 104-114 (2020)
2010 – 2019
- 2019
- [j26]Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
The reverse mathematics of Hindman's Theorem for sums of exactly two elements. Comput. 8(3-4): 253-263 (2019) - 2017
- [j25]Eric P. Astor, Damir D. Dzhafarov, Reed Solomon, Jacob Suggs:
The uniform content of partial and linear orders. Ann. Pure Appl. Log. 168(6): 1153-1171 (2017) - [c4]Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
Effectiveness of Hindman's Theorem for Bounded Sums. Computability and Complexity 2017: 134-142 - 2016
- [c3]Reed Solomon:
Computable Reductions and Reverse Mathematics. CiE 2016: 182-191 - 2014
- [j24]Johanna N. Y. Franklin, Reed Solomon:
Degrees that Are Low for Isomorphism. Comput. 3(2): 73-89 (2014) - [c2]Russell G. Miller, Reed Solomon, Rebecca M. Steiner:
On the Effectiveness of Symmetry Breaking. CiE 2014: 314-323 - 2013
- [j23]Asher M. Kach, Karen M. Lange, Reed Solomon:
Degrees of orders on torsion-free Abelian groups. Ann. Pure Appl. Log. 164(7-8): 822-836 (2013) - [j22]Manuel Lerman, Reed Solomon, Henry Towsner:
Separating Principles below Ramsey's Theorem for Pairs. J. Math. Log. 13(2): 1350007 (2013) - [c1]Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon:
Local Computability for Ordinals. CiE 2013: 161-170 - 2012
- [j21]Bjørn Kjos-Hanssen, Joseph S. Miller, Reed Solomon:
Lowness notions, measure and domination. J. Lond. Math. Soc. 85(3): 869-888 (2012) - [j20]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) - [j19]Peter Cholak, David J. Galvin, Reed Solomon:
Reverse mathematics and infinite traceable graphs. Math. Log. Q. 58(1-2): 18-28 (2012) - 2011
- [j18]Barbara F. Csima, Reed Solomon:
The complexity of central series in nilpotent computable groups. Ann. Pure Appl. Log. 162(8): 667-678 (2011) - 2010
- [j17]Asher M. Kach, Oscar Levin, Reed Solomon:
Embeddings of Computable Structures. Notre Dame J. Formal Log. 51(1): 55-68 (2010)
2000 – 2009
- 2009
- [j16]Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon:
Stability and posets. J. Symb. Log. 74(2): 693-711 (2009) - 2008
- [j15]Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon:
Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. 49(1): 1-37 (2008) - 2006
- [j14]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) - [j13]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
- [j12]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell G. Miller, Reed Solomon:
Enumerations in computable structure theory. Ann. Pure Appl. Log. 136(3): 219-246 (2005) - [j11]Steffen Lempp, Charles F. D. McCoy, Russell G. Miller, Reed Solomon:
Computable categoricity of trees of finite height. J. Symb. Log. 70(1): 151-215 (2005) - 2004
- [j10]Joseph S. Miller, Reed Solomon:
Effectiveness for infinite variable words and the Dual Ramsey Theorem. Arch. Math. Log. 43(4): 543-556 (2004) - [j9]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
- [j8]Reed Solomon:
Pi10 classes and orderable groups. Ann. Pure Appl. Log. 115(1-3): 279-302 (2002) - [j7]Steffen Lempp, Mikhail G. Peretyat'kin, Reed Solomon:
The Lindenbaum Algebra of the Theory of the class of All finite Models. J. Math. Log. 2(2) (2002) - [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. Bull. Symb. Log. 5(1): 45-58 (1999) - 1998
- [j1]Reed Solomon:
Reverse Mathematics and Fully Ordered Groups. Notre Dame J. Formal Log. 39(2): 157-189 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
