|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, Number 4, Pages 83–95
(Mi ivm6728)
|
|
|
|
Strong noncuppability in low computably enumerabele degrees
M. M. Yamaleev Chair of Algebra and Mathematical Logic, Kazan State University, Kazan, Russia
Abstract:
We prove the existence of noncomputable low computably emunerable degrees $\mathbf b<\mathbf a$ such that $\mathbf b$ is strongly noncuppable to $\mathbf a$ in the class $\mathbf R$.
Keywords:
computably emunerable sets, Turing degrees, low degrees, noncuppability.
Received: 25.03.2008
Citation:
M. M. Yamaleev, “Strong noncuppability in low computably enumerabele degrees”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 4, 83–95; Russian Math. (Iz. VUZ), 54:4 (2010), 72–81
Linking options:
https://www.mathnet.ru/eng/ivm6728 https://www.mathnet.ru/eng/ivm/y2010/i4/p83
|
Statistics & downloads: |
Abstract page: | 437 | Full-text PDF : | 79 | References: | 38 | First page: | 2 |
|