Показать сокращенную информацию
dc.contributor.author | Kalimullin I. | |
dc.date.accessioned | 2018-09-18T20:16:23Z | |
dc.date.available | 2018-09-18T20:16:23Z | |
dc.date.issued | 2008 | |
dc.identifier.issn | 1064-5616 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/138178 | |
dc.description.abstract | An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreover, it is established that for any computably enumerable (c.e.) set A there exists afamily that is X-c.e. if and only if the set X is not A-computable. © 2008 Russian Academy of Sciences, (DoM) and London Mathematical Society, Turpion Ltd. | |
dc.relation.ispartofseries | Sbornik Mathematics | |
dc.title | Almost computably enumerable families of sets | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 10 | |
dc.relation.ispartofseries-volume | 199 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 1451 | |
dc.source.id | SCOPUS10645616-2008-199-10-SID66149153886 |