|
This article is cited in 2 scientific papers (total in 2 papers)
Subfamilies of special elements of complete numberings
Z. G. Khisamiev
Abstract:
Any subfamily of a given at most countable non-empty family can be converted into a set of all special elements of a suitable numbering.
Keywords:
numbering, complete numbering, completion, special element, $\Sigma_{n}^0$-computable numbering.
Received: 18.11.2004
Citation:
Z. G. Khisamiev, “Subfamilies of special elements of complete numberings”, Algebra Logika, 45:6 (2006), 758–764; Algebra and Logic, 45:6 (2006), 431–434
Linking options:
https://www.mathnet.ru/eng/al168 https://www.mathnet.ru/eng/al/v45/i6/p758
|
Statistics & downloads: |
Abstract page: | 244 | Full-text PDF : | 87 | References: | 49 | First page: | 3 |
|