ISCAS OpenIR
the low splitting theorem in the difference hierarchy
Li AS
2005
Conference Name1st Conference on Computability in Europe (CiE 2005)
SourceLecture Notes in Computer Science
Pages287-296
Conference DateJUN 08-12,
Conference PlaceAmsterdam, NETHERLANDS
Indexed Typesci ; istp ; ei
Publish PlaceHEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
PublisherNEW COMPUTATIONAL PARADIGMS
ISSN0302-9743
ISBN3-540-26179-6
DepartmentChinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
English AbstractIt is shown that for any 2-computably enumerable Turing degrees a, l, if l = 0, and l < a, then there are 2-computably enumerable Turing degrees x(0), x(1) such that both l < x(0), x(1) < a and x(0) boolean OR x(1) = a hold, extending the Robi
KeywordComputational Complexity Computational Methods Hierarchical Systems Theorem Proving
SponsorshipKoninklijke Nederlandse Akademie van Wetenschappen, KNAW; De Nederlandse Organisatie voor Wetenschappelijk Onderzoek, NWO; European Association for Theoretical Computer Science, EATCS; Association for Symbolic Logic, ASL
Language英语
WOS IDWOS:000230476300035
Citation statistics
Cited Times:2[WOS]   [WOS Record]     [Related Records in WOS]
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/12746
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Li AS. the low splitting theorem in the difference hierarchy[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:NEW COMPUTATIONAL PARADIGMS,2005:287-296.
Files in This Item:
File Name/Size DocType Version Access License
the low splitting th(156KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li AS]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li AS]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li AS]'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.