RUS  ENG
Full version
JOURNALS // Matematicheskie Zametki // Archive
Mat. Zametki, 2008 Volume 84, Issue 4, Pages 506–515 (Mi mzm6135)
This article is cited in 3 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.

UDC: 510.5

Received: 28.04.2005

DOI: 10.4213/mzm6135


 English version: Mathematical Notes, 2008, 84:4, 473–482

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026