The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Andrew E. M. Lewis" ( http://dblp.L3S.de/Authors/Andrew_E._M._Lewis )

  Author page on DBLP  Author page in RDF  Community of Andrew E. M. Lewis in ASPL-2

Publication years (Num. hits)
2005-2010 (15) 2011-2012 (2)
Publication types (Num. hits)
article(12) inproceedings(5)
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
1Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi Empty intervals in the enumeration degrees. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi Topological aspects of the Medvedev lattice. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng The importance of Pi01 classes in effective randomness. Search on Bibsonomy J. Symb. Log. The full citation details ... 2010 DBLP  BibTeX  RDF
1Andrew E. M. Lewis, André Nies, Andrea Sorbi The First Order Theories of the Medvedev and Muchnik Lattices. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova Randomness, lowness and degrees. Search on Bibsonomy J. Symb. Log. The full citation details ... 2008 DBLP  BibTeX  RDF
1George Barmpalias, Andrew E. M. Lewis, Frank Stephan I classes, LR degrees and Turing degrees. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Andrew E. M. Lewis, George Barmpalias Randomness and the linear degrees of computability. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova Working with the LR Degrees. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andrew E. M. Lewis, Antonio Montalbán, André Nies A Weakly 2-Random Set That Is Not Generalized Low. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andrew E. M. Lewis, George Barmpalias Random reals and Lipschitz continuity. Search on Bibsonomy Mathematical Structures in Computer Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1George Barmpalias, Andrew E. M. Lewis The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 2006 DBLP  BibTeX  RDF
1George Barmpalias, Andrew E. M. Lewis A C.E. Real That Cannot Be SW-Computed by Any Omega Number. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 2006 DBLP  BibTeX  RDF
1George Barmpalias, Andrew E. M. Lewis The ibT degrees of computably enumerable sets are not dense. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andrew E. M. Lewis The Jump Classes of Minimal Covers. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1S. Barry Cooper, Andrew E. M. Lewis, Yue Yang Properly Sigma2 minimal degrees and 0'' complementation. Search on Bibsonomy Math. Log. Q. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andrew E. M. Lewis The minimal complementation property above 0'. Search on Bibsonomy Math. Log. Q. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andrew E. M. Lewis On a Question of Sacks - A Partial Solution on the Positive Side. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #17 of 17 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.