List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Analogues of Chaitin's Omega in the computably enumerable sets Information Processing Letters | 2013-03-21 | Paper |
| Empty intervals in the enumeration degrees Annals of Pure and Applied Logic | 2012-03-13 | Paper |
| A note on the join property Proceedings of the American Mathematical Society | 2012-02-24 | Paper |
| Chaitin's halting probability and the compression of strings using oracles Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2011-10-11 | Paper |
| Topological aspects of the Medvedev lattice Archive for Mathematical Logic | 2011-05-11 | Paper |
| On the degree spectrum of a ^0_1 class Transactions of the American Mathematical Society | 2010-10-29 | Paper |
| Joining up to the generalized high degrees Proceedings of the American Mathematical Society | 2010-08-16 | Paper |
| The First Order Theories of the Medvedev and Muchnik Lattices Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
| The importance of \(\Pi^0_1\) classes in effective randomness Journal of Symbolic Logic | 2010-03-15 | Paper |
| Strong minimal covers and a question of Yates: the story so far | 2010-01-13 | Paper |
| A fixed-point-free minimal degree Journal of the London Mathematical Society | 2009-12-03 | Paper |
| \(\Pi_1^0 \) classes, LR degrees and Turing degrees Annals of Pure and Applied Logic | 2008-12-05 | Paper |
| On a question of Slaman and Groszek Proceedings of the American Mathematical Society | 2008-10-24 | Paper |
| Randomness, lowness and degrees Journal of Symbolic Logic | 2008-06-09 | Paper |
| Π10 classes, strong minimal covers and hyperimmune-free degrees Bulletin of the London Mathematical Society | 2008-03-19 | Paper |
| A random degree with strong minimal cover Bulletin of the London Mathematical Society | 2007-11-27 | Paper |
| A Weakly 2-Random Set That Is Not Generalized Low Lecture Notes in Computer Science | 2007-11-13 | Paper |
| Working with the LR Degrees Lecture Notes in Computer Science | 2007-11-13 | Paper |
| A single minimal complement for the c.e. degrees Transactions of the American Mathematical Society | 2007-09-24 | Paper |
| Logical Approaches to Computational Barriers Lecture Notes in Computer Science | 2007-04-30 | Paper |
| The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees Notre Dame Journal of Formal Logic | 2007-02-20 | Paper |
| A c.e. real that cannot be sw-computed by any \(\Omega\) number Notre Dame Journal of Formal Logic | 2007-02-15 | Paper |
| Randomness and the linear degrees of computability Annals of Pure and Applied Logic | 2007-02-14 | Paper |
| Random reals and Lipschitz continuity Mathematical Structures in Computer Science | 2007-02-09 | Paper |
| The ibT degrees of computably enumerable sets are not dense Annals of Pure and Applied Logic | 2006-08-16 | Paper |
| New Computational Paradigms Lecture Notes in Computer Science | 2006-01-11 | Paper |
| The minimal complementation property above 0′ Mathematical Logic Quarterly | 2005-09-26 | Paper |
| Properly ?2 minimal degrees and 0? complementation MLQ | 2005-06-01 | Paper |
| <i>Π</i><sub>0</sub><sup>1</sup>-classes and Rado's selection principle Journal of Symbolic Logic | 1992-06-27 | Paper |
Research outcomes over time
This page was built for person: Andrew E. M. Lewis
