Andrew E. M. Lewis

Publication Activity (10 Years)

Years Active: 1991-2013
Publications (10 Years): 0

Top Topics

Artificial Intelligence

Algebraic Structures

Top Venues

Inf. Process. Lett.

J. Log. Comput.

Ann. Pure Appl. Log.

Publications

Carl G. Jockusch Jr., Andrew E. M. Lewis
Diagonally non-computable functions and bi-immunity. J. Symb. Log. 78 (3) (2013)
George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle
Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. 113 (5-6) (2013)
Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi
Empty intervals in the enumeration degrees. Ann. Pure Appl. Log. 163 (5) (2012)
Andrew E. M. Lewis
Properties of the jump classes. J. Log. Comput. 22 (4) (2012)
Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi
Topological aspects of the Medvedev lattice. Arch. Math. Log. 50 (3-4) (2011)
George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng
classes in effective randomness. J. Symb. Log. 75 (1) (2010)
Andrew E. M. Lewis, André Nies, Andrea Sorbi
The First Order Theories of the Medvedev and Muchnik Lattices. CiE (2009)
George Barmpalias, Andrew E. M. Lewis, Frank Stephan
classes, LR degrees and Turing degrees. Ann. Pure Appl. Log. 156 (1) (2008)
George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
Randomness, lowness and degrees. J. Symb. Log. 73 (2) (2008)
George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
Degrees. TAMC (2007)
Andrew E. M. Lewis, Antonio Montalbán, André Nies
A Weakly 2-Random Set That Is Not Generalized Low. CiE (2007)
Andrew E. M. Lewis, George Barmpalias
Randomness and the linear degrees of computability. Ann. Pure Appl. Log. 145 (3) (2007)
George Barmpalias, Andrew E. M. Lewis
A C.E. Real That Cannot Be SW-Computed by Any Ω Number. Notre Dame J. Formal Log. 47 (2) (2006)
Andrew E. M. Lewis
The Jump Classes of Minimal Covers. CiE (2006)
Andrew E. M. Lewis, George Barmpalias
Random reals and Lipschitz continuity. Math. Struct. Comput. Sci. 16 (5) (2006)
George Barmpalias, Andrew E. M. Lewis
The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. 141 (1-2) (2006)
George Barmpalias, Andrew E. M. Lewis
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame J. Formal Log. 47 (3) (2006)
S. Barry Cooper, Andrew E. M. Lewis, Yue Yang
minimal degrees and 0'' complementation. Math. Log. Q. 51 (3) (2005)
Andrew E. M. Lewis
On a Question of Sacks - A Partial Solution on the Positive Side. CiE (2005)
Andrew E. M. Lewis
The minimal complementation property above 0'. Math. Log. Q. 51 (5) (2005)
Carl G. Jockusch Jr., Andrew E. M. Lewis, Jeffrey B. Remmel
-Classes and Rado's Selection Principle. J. Symb. Log. 56 (2) (1991)