中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR

Search Results

Help

Item hits: (Results 1-6 of 6)

Filters    
Items/Page:    Sort:
Kolmogorov complexity and computably enumerable sets [期刊论文]
ANNALS OF PURE AND APPLIED LOGIC, 2013-01-01, 卷号: 164, 期号: 12, 页码: 1187-1200
Barmpalias, George; Li, Angsheng

 
almost universal cupping and diamond embeddings [期刊论文]
ANNALS OF PURE AND APPLIED LOGIC, 2012-01-01, 卷号: 163, 期号: 6, 页码: 717-729
Liu Jiang; Wu Guohua

 
bounding computably enumerable degrees in the ershov hierarchy [期刊论文]
ANNALS OF PURE AND APPLIED LOGIC, 2006-01-01, 卷号: 141, 期号: 1-2, 页码: 79-88
Li AS; Wu GH; Yang Y
  |  
 
bounding computably enumerable degrees in the ershov hierarchy [期刊论文]
ANNALS OF PURE AND APPLIED LOGIC, 2006-01-01, 卷号: 141, 期号: 1-2, 页码: 79-88
Li AS; Wu GH; Yang Y
  |  
 
bounding computably enumerable degrees in the ershov hierarchy [期刊论文]
ANNALS OF PURE AND APPLIED LOGIC, 2006-01-01, 卷号: 141, 期号: 1-2, 页码: 79-88
Li AS; Wu GH; Yang Y
  |  
 
Bounding computably enumerable degrees in the Ershov hierarchy [期刊论文]
Annals of Pure and Applied Logic, 2006-01-01, 卷号: 141, 期号: 40180, 页码: 79-88
Li AS; Wu GH; Yang Ye
  |  
 

1

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace