Показать сокращенную информацию
dc.contributor.author | Faizrahmanov M. | |
dc.date.accessioned | 2018-09-18T20:31:39Z | |
dc.date.available | 2018-09-18T20:31:39Z | |
dc.date.issued | 2010 | |
dc.identifier.issn | 0037-4466 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/140800 | |
dc.description.abstract | If ν and μ are some Δcomputable numberings of families of sets of the naturals then P(x,y) ⇔ ν(x)′ ≠ μ(y) is a Σpredicate. Deriving corollaries from this result, we obtain a sufficient condition for existence of a Δcomputable numbering of the subfamily of all sets in a given family with the Turing jumps belonging to a fixed level of the Ershov hierarchy, and we deduce existence of a Σcomputable numbering of the family of all superlow sets. © 2010 Pleiades Publishing, Ltd. | |
dc.relation.ispartofseries | Siberian Mathematical Journal | |
dc.subject | computable numbering | |
dc.subject | constructive ordinal | |
dc.subject | Ershov hierarchy | |
dc.subject | low set | |
dc.subject | superlow set | |
dc.title | Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 6 | |
dc.relation.ispartofseries-volume | 51 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 1135 | |
dc.source.id | SCOPUS00374466-2010-51-6-SID78650757353 |