Pi01-Classes and Rado's Selection Principle. - Carl G. Jockusch Jr.; Andrew E. M. Lewis; Jeffrey B. Remmel (J. Symb. Log., 1991)

On a Question of Sacks - A Partial Solution on the Positive Side. - Andrew E. M. Lewis (CiE, 2005)

Properly Sigma2 minimal degrees and 0'' complementation. - S. Barry Cooper; Andrew E. M. Lewis; Yue Yang 004 (Math. Log. Q., 2005)

The minimal complementation property above 0'. - Andrew E. M. Lewis (Math. Log. Q., 2005)

The Jump Classes of Minimal Covers. - Andrew E. M. Lewis (CiE, 2006)

The ibT degrees of computably enumerable sets are not dense. - George Barmpalias; Andrew E. M. Lewis (Ann. Pure Appl. Log., 2006)

Random reals and Lipschitz continuity. - Andrew E. M. Lewis; George Barmpalias (Math. Struct. Comput. Sci., 2006)

A C.E. Real That Cannot Be SW-Computed by Any Ω Number. - George Barmpalias; Andrew E. M. Lewis (Notre Dame J. Formal Log., 2006)

The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. - George Barmpalias; Andrew E. M. Lewis (Notre Dame J. Formal Log., 2006)

A Weakly 2-Random Set That Is Not Generalized Low. - Andrew E. M. Lewis; Antonio Montalbán; André Nies (CiE, 2007)

Working with the LR Degrees. - George Barmpalias; Andrew E. M. Lewis; Mariya Ivanova Soskova (TAMC, 2007)

Randomness and the linear degrees of computability. - Andrew E. M. Lewis; George Barmpalias (Ann. Pure Appl. Log., 2007)

I classes, LR degrees and Turing degrees. - George Barmpalias; Andrew E. M. Lewis; Frank Stephan 001 (Ann. Pure Appl. Log., 2008)

Randomness, lowness and degrees. - George Barmpalias; Andrew E. M. Lewis; Mariya Ivanova Soskova (J. Symb. Log., 2008)

The First Order Theories of the Medvedev and Muchnik Lattices. - Andrew E. M. Lewis; André Nies; Andrea Sorbi (CiE, 2009)

The importance of Pi01 classes in effective randomness. - George Barmpalias; Andrew E. M. Lewis; Keng Meng Ng (J. Symb. Log., 2010)

Topological aspects of the Medvedev lattice. - Andrew E. M. Lewis; Richard A. Shore; Andrea Sorbi (Arch. Math. Log., 2011)

Empty intervals in the enumeration degrees. - Thomas F. Kent; Andrew E. M. Lewis; Andrea Sorbi (Ann. Pure Appl. Log., 2012)

Properties of the jump classes. - Andrew E. M. Lewis (J. Log. Comput., 2012)

Analogues of Chaitin's Omega in the computably enumerable sets. - George Barmpalias; Rupert Hölzl 001; Andrew E. M. Lewis; Wolfgang Merkle (Inf. Process. Lett., 2013)

Diagonally non-computable functions and bi-immunity. - Carl G. Jockusch Jr.; Andrew E. M. Lewis (J. Symb. Log., 2013)