Показать сокращенную информацию
dc.contributor.author | Faizrakhmanov M. | |
dc.date.accessioned | 2018-09-18T20:16:40Z | |
dc.date.available | 2018-09-18T20:16:40Z | |
dc.date.issued | 2010 | |
dc.identifier.issn | 1066-369X | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/138213 | |
dc.description.abstract | In this paper we prove the following theorem: For every notation of a constructive ordinal there exists a low 2-computably enumerable degree that is not splittable into two lower 2-computably enumerable degrees whose jumps belong to the corresponding Δ-level of the Ershov hierarchy. © Allerton Press, Inc., 2010. | |
dc.relation.ispartofseries | Russian Mathematics | |
dc.subject | 2-computably enumerable degrees | |
dc.subject | Constructive ordinals | |
dc.subject | Ershov hierarchy | |
dc.subject | Low degrees | |
dc.subject | Turing jumps | |
dc.title | Decomposability of low 2-computably enumerable degrees and turing jumps in the ershov hierarchy | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 12 | |
dc.relation.ispartofseries-volume | 54 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 51 | |
dc.source.id | SCOPUS1066369X-2010-54-12-SID79952843116 |