default search action
Andrew E. M. Lewis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j16]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): 171-178 (2013) - [j15]Carl G. Jockusch Jr., Andrew E. M. Lewis:
Diagonally non-computable functions and bi-immunity. J. Symb. Log. 78(3): 977-988 (2013) - 2012
- [j14]Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi:
Empty intervals in the enumeration degrees. Ann. Pure Appl. Log. 163(5): 567-574 (2012) - [j13]Andrew E. M. Lewis:
Properties of the jump classes. J. Log. Comput. 22(4): 845-855 (2012) - 2011
- [j12]Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi:
Topological aspects of the Medvedev lattice. Arch. Math. Log. 50(3-4): 319-340 (2011) - 2010
- [j11]George Barmpalias
The importance of Pi01 classes in effective randomness. J. Symb. Log. 75(1): 387-400 (2010)
2000 – 2009
- 2009
- [c5]Andrew E. M. Lewis, André Nies
The First Order Theories of the Medvedev and Muchnik Lattices. CiE 2009: 324-331 - 2008
- [j10]George Barmpalias
I classes, LR degrees and Turing degrees. Ann. Pure Appl. Log. 156(1): 21-38 (2008) - [j9]George Barmpalias
Randomness, lowness and degrees. J. Symb. Log. 73(2): 559-577 (2008) - 2007
- [j8]Andrew E. M. Lewis, George Barmpalias
Randomness and the linear degrees of computability. Ann. Pure Appl. Log. 145(3): 252-257 (2007) - [c4]Andrew E. M. Lewis, Antonio Montalbán, André Nies
A Weakly 2-Random Set That Is Not Generalized Low. CiE 2007: 474-477 - [c3]George Barmpalias
Working with the LR Degrees. TAMC 2007: 89-99 - 2006
- [j7]George Barmpalias
The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. 141(1-2): 51-60 (2006) - [j6]Andrew E. M. Lewis, George Barmpalias
Random reals and Lipschitz continuity. Math. Struct. Comput. Sci. 16(5): 737-749 (2006) - [j5]George Barmpalias
A C.E. Real That Cannot Be SW-Computed by Any Ω Number. Notre Dame J. Formal Log. 47(2): 197-209 (2006) - [j4]George Barmpalias
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame J. Formal Log. 47(3): 361-370 (2006) - [c2]Andrew E. M. Lewis:
The Jump Classes of Minimal Covers. CiE 2006: 307-318 - 2005
- [j3]S. Barry Cooper, Andrew E. M. Lewis, Yue Yang:
Properly Sigma2 minimal degrees and 0'' complementation. Math. Log. Q. 51(3): 274-276 (2005) - [j2]Andrew E. M. Lewis:
The minimal complementation property above 0'. Math. Log. Q. 51(5): 470-492 (2005) - [c1]Andrew E. M. Lewis:
On a Question of Sacks - A Partial Solution on the Positive Side. CiE 2005: 275-286
1990 – 1999
- 1991
- [j1]Carl G. Jockusch Jr., Andrew E. M. Lewis, Jeffrey B. Remmel:
Pi01-Classes and Rado's Selection Principle. J. Symb. Log. 56(2): 684-693 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: