Algebra Logika, 2006 Volume 45, Number 6, Pages 758–764
(Mi al168)
|
This article is cited 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.
UDC:
510.5 Received: 18.11.2004
© , 2024
Fulltext:
PDF file (129 kB)
