Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00153-005-0306-y
Title: Lowness for genericity
Authors: Yu, L. 
Issue Date: Feb-2006
Citation: Yu, L. (2006-02). Lowness for genericity. Archive for Mathematical Logic 45 (2) : 233-238. ScholarBank@NUS Repository. https://doi.org/10.1007/s00153-005-0306-y
Abstract: We study lowness for genericity. We show that there exists no Turing degree which is low for 1-genericity and all of computably traceable degrees are low for weak 1-genericity.
Source Title: Archive for Mathematical Logic
URI: http://scholarbank.nus.edu.sg/handle/10635/103522
ISSN: 09335846
DOI: 10.1007/s00153-005-0306-y
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

20
checked on May 21, 2018

WEB OF SCIENCETM
Citations

19
checked on Apr 30, 2018

Page view(s)

37
checked on May 25, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.