the low splitting theorem in the difference hierarchy
文献类型:会议论文
作者 | Li AS |
出版日期 | 2005 |
会议名称 | 1st Conference on Computability in Europe (CiE 2005) |
会议日期 | JUN 08-12, |
会议地点 | Amsterdam, NETHERLANDS |
关键词 | Computational complexity Computational methods Hierarchical systems Theorem proving |
页码 | 287-296 |
英文摘要 | It 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 |
收录类别 | SCI ; ISTP ; EI |
会议主办者 | Koninklijke Nederlandse Akademie van Wetenschappen, KNAW; De Nederlandse Organisatie voor Wetenschappelijk Onderzoek, NWO; European Association for Theoretical Computer Science, EATCS; Association for Symbolic Logic, ASL |
会议录 | Lecture Notes in Computer Science
![]() |
会议录出版者 | NEW COMPUTATIONAL PARADIGMS |
会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
语种 | 英语 |
ISSN号 | 0302-9743 |
ISBN号 | 3-540-26179-6 |
WOS记录号 | WOS:000230476300035 |
源URL | [http://124.16.136.157/handle/311060/12746] ![]() |
专题 | 软件研究所_软件所图书馆_会议论文 |
推荐引用方式 GB/T 7714 | Li AS. the low splitting theorem in the difference hierarchy[C]. 见:1st Conference on Computability in Europe (CiE 2005). Amsterdam, NETHERLANDS. JUN 08-12,. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。