|
A family with a single minimal but not least numbering
M. Kh. Faizrahmanov Kazan (Volga Region) Federal University
Abstract:
We prove the existence of a family of computably enumerable sets that, up to equivalence, has a unique computable minimal but not least numbering.
Keywords:
minimal numbering, computable numbering, computable family, discrete family.
Received: 27.04.2023 Revised: 01.10.2023 Accepted: 28.01.2024
Citation:
M. Kh. Faizrahmanov, “A family with a single minimal but not least numbering”, Sibirsk. Mat. Zh., 65:2 (2024), 395–407
Linking options:
https://www.mathnet.ru/eng/smj7862 https://www.mathnet.ru/eng/smj/v65/i2/p395
|
Statistics & downloads: |
Abstract page: | 60 | Full-text PDF : | 1 | References: | 18 | First page: | 15 |
|