|
This article is cited in 4 scientific papers (total in 4 papers)
Noncancellable, singular, and conjugate degrees
I. I. Batyrshin Kazan (Volga Region) Federal University, ul. Kremlevskaya 18, Kazan, 420008 Russia
Abstract:
We study degree structures of stronger algorithmic reducibilities inside the degrees of weaker algorithmic ones. Results in this area are reviewed for algorithmic reducibilities $m$-, $1$-, $tt$-, $wtt$-, $T$-, $e$-, $s$-, $Q$-, and we formulate questions that are still not settled for these. A computably enumerable $Q$-degree which consists of one computably enumerable $m$-degree is constructed.
Keywords:
$Q$-reducibility, $m$-reducibility, computably enumerable degrees, noncancellable degrees, singular degrees, conjugate degrees.
Received: 29.02.2016 Revised: 27.05.2016
Citation:
I. I. Batyrshin, “Noncancellable, singular, and conjugate degrees”, Algebra Logika, 56:3 (2017), 275–299; Algebra and Logic, 56:3 (2017), 181–196
Linking options:
https://www.mathnet.ru/eng/al792 https://www.mathnet.ru/eng/al/v56/i3/p275
|
Statistics & downloads: |
Abstract page: | 178 | Full-text PDF : | 30 | References: | 40 | First page: | 10 |
|