|
This article is cited in 13 scientific papers (total in 13 papers)
Almost computably enumerable families of sets
I. Sh. Kalimullin Kazan State University, Faculty of Mechanics and Mathematics
Abstract:
An almost computably enumerable family that is not
$\varnothing'$-computably enumerable is constructed. Moreover, it is established
that for any computably enumerable (c.e.) set $A$ there exists
a family that is $X$-c.e. if and only if the set $X$ is not
$A$-computable.
Bibliography: 5 titles.
Received: 09.07.2007 and 03.04.2008
Citation:
I. Sh. Kalimullin, “Almost computably enumerable families of sets”, Sb. Math., 199:10 (2008), 1451–1458
Linking options:
https://www.mathnet.ru/eng/sm3925https://doi.org/10.1070/SM2008v199n10ABEH003967 https://www.mathnet.ru/eng/sm/v199/i10/p33
|
Statistics & downloads: |
Abstract page: | 552 | Russian version PDF: | 218 | English version PDF: | 13 | References: | 54 | First page: | 12 |
|