This article is cited in 2 scientific papers (total in 2 papers)
Relative Enumerability in Ershov's Hierarchy
I. I. Batyrshin Kazan State University
Abstract:
Generalizations to various levels of Ershov's hierarchy of the relationship between $n$ -computable enumerability and relative enumerability are considered.
Keywords:
relative enumerability, $n$ -computable enumerability, Ershov's hierarchy, constructive ordinal, Turing degree, computable function, limit ordinal.
Received: 28.04.2005
Citation:
I. I. Batyrshin, “Relative Enumerability in Ershov's Hierarchy”, Mat. Zametki , 84 :4 (2008), 506–515 ; Math. Notes , 84 :4 (2008), 473–482
Linking options:
https://www.mathnet.ru/eng/mzm6135 https://doi.org/10.4213/mzm6135 https://www.mathnet.ru/eng/mzm/v84/i4/p506
2
CITATIONS
2
Total citations
1
Recent citation
0.79
Field Citation Ratio
n/a
Relative Citation Ratio
Statistics & downloads :
Abstract page: 370 Full-text PDF : 201 References: 52 First page: 6