Relative enumerability in Ershov's hierarchy (Q2518068): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0001434608090198 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081466021 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relative enumerability in Ershov's hierarchy |
scientific article |
Statements
Relative enumerability in Ershov's hierarchy (English)
0 references
12 January 2009
0 references
Connections between the \(n\)-CEA hierarchy and the \(n\)-c.e. hierarchy have been explored. This paper takes one such connection that appeared in [\textit{M. M. Arslanov, G. L. LaForte} and \textit{T. A. Slaman}, J. Symb. Log. 63, No. 2, 411--420 (1998; Zbl 0911.03021)] and generalizes it from the \(n\)-c.e. hierarchy to Ershov's hierarchy. The author also shows that the result cannot be extended in various directions.
0 references
relative enumerability
0 references
\(n\)-computable enumerability
0 references
Ershov's hierarchy
0 references
constructive ordinal
0 references
Turing degree
0 references
computable function
0 references
limit ordinal
0 references
