The Structures Inside Turing Degrees of Recursively Enumerable Generic Sets  

作　　者：丁德成 

机构地区：[1]Department of Mathematics,Nanjing University,Nanjing 210008.PRC

出　　处：《Chinese Science Bulletin》1993年第9期705-708,共4页

基　　金：Project supported by the National Natural Science Foundation of China.

摘　　要：Jockusch and Ingrassia introduced notions of e-genericity, s-genericity and p-genericity for recursively enumerable sets in 1985 and 1980 respectively. It has been shown that there are many important properties of recursively enumerable generic sets and degrees. We have investigated the structures of wtt-degrees inside recursively enumerable p-generic Turing degrees and proved that every r.e. p-generic degree is noncontiguous. In this note, we

关 键 词：recursively enumerahly GENERIC SET and DEGREE wtt topped wtt bottomed 

分 类 号：N[自然科学总论]