ISCAS OpenIR  > 基础软件国家工程研究中心
Bounding and nonbounding minimal pairs in the enumeration degrees
Cooper SB; Li AS; Sorbi A; Yang Ye; Cooper; SB (通讯作者); Univ Leeds; Sch Math; Dept Pure Math; Leeds LS2 9JT; W Yorkshire England
2005
SourceJournal of Symbolic Logic
Volume70Issue:3Pages:741-766
Indexed Typesci
Department基础软件国家工程研究中心
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/3812
Collection基础软件国家工程研究中心
Corresponding AuthorCooper; SB (通讯作者); Univ Leeds; Sch Math; Dept Pure Math; Leeds LS2 9JT; W Yorkshire England
Recommended Citation
GB/T 7714
Cooper SB,Li AS,Sorbi A,et al. Bounding and nonbounding minimal pairs in the enumeration degrees[J]. Journal of Symbolic Logic,2005,70(3):741-766.
APA Cooper SB.,Li AS.,Sorbi A.,Yang Ye.,Cooper.,...&W Yorkshire England.(2005).Bounding and nonbounding minimal pairs in the enumeration degrees.Journal of Symbolic Logic,70(3),741-766.
MLA Cooper SB,et al."Bounding and nonbounding minimal pairs in the enumeration degrees".Journal of Symbolic Logic 70.3(2005):741-766.
Files in This Item:
File Name/Size DocType Version Access License
2.pdf(284KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Cooper SB]'s Articles
[Li AS]'s Articles
[Sorbi A]'s Articles
Baidu academic
Similar articles in Baidu academic
[Cooper SB]'s Articles
[Li AS]'s Articles
[Sorbi A]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Cooper SB]'s Articles
[Li AS]'s Articles
[Sorbi A]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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