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.

UDC: 510.532

Received: 25.03.2008

 English version: Russian Mathematics (Izvestiya VUZ. Matematika), 2010, 54:4, 72–81

Bibliographic databases:

• 
•