|
 | Up a level |
Barmpalias, George and Day, Adam R. and Lewis, Andrew E. M. (2014) The typical Turing degree. Proceedings of the London Mathematical Society, 109 (1). pp. 1-39. ISSN 0024-6115
Jockush, Carl G. and Lewis, Andrew E. M. (2013) Diagonally non-computable functions and bi-immunity. Journal of Symbolic Logic. ISSN 0022-4812 (Submitted)
Downey, Rod and Greenberg, Noam and Lewis, Andrew E. M. and Montalbán, Antonio (2013) On the degree spectrum of a π01 class. Transactions of the American Mathematical Society, 365 (06). pp. 2977-3018. ISSN 0002-9947
Kent, Thomas F. and Lewis, Andrew E. M. and Sorbi, Andrea (2012) Empty intervals in the enumeration degrees. Annals of Pure and Applied Logic, 163 (5). pp. 567-574. ISSN 0168-0072
Barmpalias, George and Lewis, Andrew E. M. (2012) Measure and cupping in the Turing degrees. Proceedings of the American Mathematical Society, 140 (10). pp. 3607-3622. ISSN 0002-9939
Lewis, Andrew E. M. (2012) Properties of the jump classes. Journal of Logic and Computation, 22 (4). pp. 845-855. ISSN 0955-792X
Lewis, Andrew E. M. (2012) A note on the join property. Proceedings of the American Mathematical Society, 140 (2). pp. 707-714. ISSN 0002-9939
Barmpalias, George and Lewis, Andrew E. M. (2011) Chaitin's halting probability and the compression of strings using oracles. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 467 (2134). pp. 2912-2926. ISSN 1364-5021
Lewis, Andrew E. M. and Shore, Richard A. and Sorbi, Andrea (2011) Topological aspects of the Medvedev lattice. Archive for Mathematical Logic, 50 (3-4). pp. 319-340. ISSN 0933-5846
Ellison, Philip and Lewis, Andrew E. M. (2010) Joining up to the generalized high degrees. Proceedings of the American Mathematical Society, 138 (8). pp. 2949-2960. ISSN 0002-9939
Kent, Thomas and Lewis, Andrew E. M. (2010) On the degree spectrum of a π01 class. Transactions of the American Mathematical Society, 362 (10). pp. 5283-5319. ISSN 0002-9947
Barmapalias, George and Lewis, Andrew E. M. and Meng Ng, Keng (2010) The importance of π⁰₁ classes in effective randomness. Journal of Symbolic Logic, 75 (1). pp. 387-400. ISSN 0022-4812
Kumabe, Masahiro and Lewis, Andrew E. M. (2009) A fixed-point-free minimal degree. Journal of the London Mathematical Society, 80 (3). pp. 785-797. ISSN 0024-6107
Barmpalias, George and Lewis, Andrew E. M. and Stephan, Frank (2008) Π10 classes, LR degrees and Turing degrees. Annals of Pure and Applied Logic, 156 (1). pp. 21-38. ISSN 0168-0072
Lewis, Andrew E. M. (2008) On a question of Slaman and Groszek. Proceedings of the American Mathematical Society, 136 (10). pp. 3663-3668. ISSN 0002-9939
Barmpalias, George and Lewis, Andrew E. M. and Soskova, Mariya (2008) Randomness, lowness and degrees. Journal of Symbolic Logic, 73 (2). pp. 559-577. ISSN 0022-4812
Lewis, Andrew E. M. (2007) Π10 classes, strong minimal covers and hyperimmune-free degrees. Bulletin of the London Mathematical Society, 39 (6). pp. 845-855. ISSN 0024-6093
Lewis, Andrew E. M. and Barmpalias, George (2007) Randomness and the linear degrees of computability. Annals of Pure and Applied Logic, 145 (3). pp. 252-257. ISSN 0168-0072
Lewis, Andrew E. M. (2007) A random degree with strong minimal cover. Bulletin of the London Mathematical Society, 39 (5). pp. 848-856. ISSN 0024-6093
Lewis, Andrew E. M. (2007) A single minimal complement for the c.e. degrees. Transactions of the American Mathematical Society, 359 (12). pp. 5817-5865. ISSN 0002-9947
Lewis, Andrew E. M. and Barmpalias, George (2006) Random reals and Lipschitz continuity. Mathematical Structures in Computer Science, 16 (5). pp. 737-749. ISSN 0960-1295
Barmpalias, George and Lewis, Andrew E. M. (2006) A c.e. real that cannot be sw-computed by any Ω number. Notre Dame Journal of Formal Logic, 47 (2). pp. 197-209. ISSN 0029-4527
Barmpalias, George and Lewis, Andrew E. M. (2006) The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees. Notre Dame Journal of Formal Logic, 47 (3). pp. 361-370. ISSN 0029-4527
Barmpalias, George and Lewis, Andrew E. M. (2006) The ibT degrees of computably enumerable sets are not dense. Annals of Pure and Applied Logic, 141 (1-2). pp. 51-60. ISSN 0168-0072
Cooper, S. Barry and Lewis, Andrew E. M. and Yang, Yue (2005) Properly Σ2 minimal degrees and 0″ complementation. Mathematical Logic Quarterly, 51 (3). pp. 274-276. ISSN 0942-5616
Lewis, Andrew E. M. (2005) The minimal complementation property above 0′. Mathematical Logic Quarterly, 51 (5). pp. 470-492. ISSN 0942-5616
Lewis, Andrew E. M. (2004) Finite cupping sets. Archive for Mathematical Logic, 43 (7). pp. 845-858. ISSN 0933-5846
Lewis, Andrew E. M. (2004) Minimal complements for degrees below 0'. Journal of Symbolic Logic, 69 (4). pp. 937-966. ISSN 0022-4812
Lewis, Andrew E. M. (2009) Strong minimal covers and a question of Yates: the story so far. In: Cooper, Barry and Geuvers, Herman and Pillay, Anand and Väänänen, Jouko, (eds.) Logic Colloquium 2006. Lecture notes in logic (32). Cambridge University Press, Cambridge, UK, pp. 213-228. ISBN 9780521110815
Lewis, Andrew E. M. and Nies, André and Sorbi, Andrea (2009) The first order theories of the Medvedev and Muchnik lattices. In: Ambos-Spies, Klaus and Löwe, Benedikt and Merkle, Wolfgang, (eds.) Mathematical Theory and Computational Practice: 5th Conference on Computability in Europe, Cie 2009, Heidelberg, Germany, July 1. Lecture notes in computer science (5635). Springer, Berlin, pp. 324-331. ISBN 9783642030727
Barmpalias, George and Lewis, Andrew E. M. and Soskova, Mariya (2007) Working with the LR degrees. In: Cai, Jin-Yi and Cooper, S. Barry and Zhu, Hong, (eds.) Theory and Applications of Models of Computation: 4th International Conference, Tamc 2007, Shanghai, China, May 22-25, 2007. Lecture notes in computer science (4484). Springer, Berlin, pp. 89-99. ISBN 9783540725039
Lewis, Andrew E. M. and Montalbán, Antonio and Nies, André (2007) A weakly 2-random set that is not generalized low. In: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea, (eds.) Computation and Logic in the Real World: Third Conference on Computability in Europe, Cie 2007, Siena, Italy, June 18-23, 2007. Lecture notes in computer science (4497). Springer, Berlin, pp. 474-477. ISBN 9783540730002
