Показать сокращенную информацию
dc.contributor.author | Arslanov M. | |
dc.contributor.author | Cooper S. | |
dc.contributor.author | Li A. | |
dc.date.accessioned | 2018-09-17T20:55:53Z | |
dc.date.available | 2018-09-17T20:55:53Z | |
dc.date.issued | 2000 | |
dc.identifier.issn | 0942-5616 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/134273 | |
dc.description.abstract | We show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L <T A, then there is a c. e. splitting A0 ∐ A1 = A such that Ai ⊗ L <T A. In particular, if L is low and n-c. e., then Ai ⊗ L is n-c. e. and hence there is no low maximal n-c. e. degree. | |
dc.relation.ispartofseries | Mathematical Logic Quarterly | |
dc.subject | Computably enumerable set | |
dc.subject | Maximal d. c. e. degree | |
dc.subject | N-c.E. set | |
dc.title | There is no low maximal d. c. e. degree | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 3 | |
dc.relation.ispartofseries-volume | 46 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 409 | |
dc.source.id | SCOPUS09425616-2000-46-3-SID0034344093 |