|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi |
Empty intervals in the enumeration degrees.  |
Ann. Pure Appl. Logic  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi |
Topological aspects of the Medvedev lattice.  |
Arch. Math. Log.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng |
The importance of Pi01 classes in effective randomness.  |
J. Symb. Log.  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, André Nies, Andrea Sorbi |
The First Order Theories of the Medvedev and Muchnik Lattices.  |
CiE  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova |
Randomness, lowness and degrees.  |
J. Symb. Log.  |
2008 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis, Frank Stephan |
I classes, LR degrees and Turing degrees.  |
Ann. Pure Appl. Logic  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, George Barmpalias |
Randomness and the linear degrees of computability.  |
Ann. Pure Appl. Logic  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova |
Working with the LR Degrees.  |
TAMC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, Antonio Montalbán, André Nies |
A Weakly 2-Random Set That Is Not Generalized Low.  |
CiE  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, George Barmpalias |
Random reals and Lipschitz continuity.  |
Mathematical Structures in Computer Science  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis |
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.  |
Notre Dame Journal of Formal Logic  |
2006 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis |
A C.E. Real That Cannot Be SW-Computed by Any Omega Number.  |
Notre Dame Journal of Formal Logic  |
2006 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis |
The ibT degrees of computably enumerable sets are not dense.  |
Ann. Pure Appl. Logic  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis |
The Jump Classes of Minimal Covers.  |
CiE  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Barry Cooper, Andrew E. M. Lewis, Yue Yang |
Properly Sigma2 minimal degrees and 0'' complementation.  |
Math. Log. Q.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis |
The minimal complementation property above 0'.  |
Math. Log. Q.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis |
On a Question of Sacks - A Partial Solution on the Positive Side.  |
CiE  |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|