|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Peter Cholak, David Galvin, Reed Solomon |
Reverse mathematics and infinite traceable graphs.  |
Math. Log. Q.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Barbara F. Csima, Reed Solomon |
The complexity of central series in nilpotent computable groups. |
Ann. Pure Appl. Logic |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Asher M. Kach, Oscar Levin, Reed Solomon |
Embeddings of Computable Structures. |
Notre Dame Journal of Formal Logic |
2010 |
DBLP BibTeX RDF |
|
| 1 | Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon |
Stability and posets. |
J. Symb. Log. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon |
Self-Embeddings of Computable Trees. |
Notre Dame Journal of Formal Logic |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon |
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. |
J. Symb. Log. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Peter Cholak, Richard A. Shore, Reed Solomon |
A computably stable structure with no Scott family of finitary formulas. |
Arch. Math. Log. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Lempp, Charles F. D. McCoy, Russell Miller, Reed Solomon |
Computable categoricity of trees of finite height. |
J. Symb. Log. |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Cholak, Alberto Marcone, Reed Solomon |
Reverse mathematics and the equivalence of definitions for well and better quasi-orders. |
J. Symb. Log. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Joseph S. Miller, Reed Solomon |
Effectiveness for infinite variable words and the Dual Ramsey Theorem. |
Arch. Math. Log. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Reed Solomon |
Pi10 classes and orderable groups. |
Ann. Pure Appl. Logic |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
computability theory, effective algebra, reverse mathematics, lattice-ordered groups, automorphism groups |
| 1 | Reed Solomon |
PI11-CA0 and Order Types of Countable Ordered Groups. |
J. Symb. Log. |
2001 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Steffen Lempp, André Nies, Reed Solomon |
On the filter of computably enumerable supersets of an r-maximal set. |
Arch. Math. Log. |
2001 |
DBLP DOI BibTeX RDF |
Computably enumerable set, r-maximal set, Superset, Tower |
| 1 | Reed Solomon |
Ordered groups: a case study in reverse mathematics. |
Bulletin of Symbolic Logic |
1999 |
DBLP BibTeX RDF |
|
| 1 | Reed Solomon |
Reverse Mathematics and Fully Ordered Groups. |
Notre Dame Journal of Formal Logic |
1998 |
DBLP BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")