| 2008 |
|---|
| 9 | EE | George Barmpalias,
Andrew E. M. Lewis,
Frank Stephan:
I classes, LR degrees and Turing degrees.
Ann. Pure Appl. Logic 156(1): 21-38 (2008) |
| 2007 |
|---|
| 8 | EE | George Barmpalias,
Andrew E. M. Lewis,
Mariya Ivanova Soskova:
Working with the LR Degrees.
TAMC 2007: 89-99 |
| 7 | EE | Andrew E. M. Lewis,
George Barmpalias:
Randomness and the linear degrees of computability.
Ann. Pure Appl. Logic 145(3): 252-257 (2007) |
| 2006 |
|---|
| 6 | EE | Andrew E. M. Lewis:
The Jump Classes of Minimal Covers.
CiE 2006: 307-318 |
| 5 | EE | George Barmpalias,
Andrew E. M. Lewis:
The ibT degrees of computably enumerable sets are not dense.
Ann. Pure Appl. Logic 141(1-2): 51-60 (2006) |
| 4 | EE | Andrew E. M. Lewis,
George Barmpalias:
Random reals and Lipschitz continuity.
Mathematical Structures in Computer Science 16(5): 737-749 (2006) |
| 2005 |
|---|
| 3 | EE | Andrew E. M. Lewis:
On a Question of Sacks - A Partial Solution on the Positive Side.
CiE 2005: 275-286 |
| 2 | EE | S. Barry Cooper,
Andrew E. M. Lewis,
Yue Yang:
Properly Sigma2 minimal degrees and 0'' complementation.
Math. Log. Q. 51(3): 274-276 (2005) |
| 1 | EE | Andrew E. M. Lewis:
The minimal complementation property above 0'.
Math. Log. Q. 51(5): 470-492 (2005) |
