|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, Number 12, Pages 58–66
(Mi ivm7161)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
M. Kh. Faizrakhmanov Chair of Algebra and Mathematical Logic, Kazan State University, Kazan, Russia
Abstract:
In this paper we prove the following theorem: For every notation of constructive ordinal, there exists a low 2-computably enumerable degree which is not splittable into two lower 2-computably enumerable degrees, whose jumps belong to the $\Delta$-level of the Ersov hierarchy that corresponds to this notation.
Keywords:
low degrees, 2-computably enumerable degrees, Ershov hierarchy, Turing jumps, constructive ordinals.
Received: 08.04.2009
Citation:
M. Kh. Faizrakhmanov, “Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 12, 58–66; Russian Math. (Iz. VUZ), 54:12 (2010), 51–58
Linking options:
https://www.mathnet.ru/eng/ivm7161 https://www.mathnet.ru/eng/ivm/y2010/i12/p58
|
|