Abstract
Questions of definability of computably enumerable degrees in the difference hierarchy (degrees of sets from finite levels of the Ershov difference hierarchy) are studied. Several approaches to the solution of this problem are outlined.
Similar content being viewed by others
References
U. Andrews, R. Kuyper, S. Lempp, M. Soskova, and M. M. Yamaleev, “Nondensity of double bubbles in the D. C. E. degrees,” Lect. Notes Comput. Sci. 10010, 547–562 (2017).
M. M. Arslanov, I. Sh. Kalimullin, and S. Lempp, “On Downey’s conjecture,” J. Symb. Logic 75, 401–441 (2010).
M. M. Arslanov, “Definable relations in Turing degree structures,” J. Logic Comput. 23, 1145–1154 (2013).
M. M. Arslanov, “Model-theoretic properties of turing degrees in the Ershov difference hierarchy,” Proc. Steklov Inst.Math. 278, 57–65 (2012).
S. B. Cooper and A. Li, “Turing definability in the Ershov hierarchy,” J. London Math. Soc. 66, 513–526 (2002).
S. B. Cooper and A. Li, “Splitting and cone avoidance in the d. c. e. degrees,” Sci. China, Ser. A 45, 1135–1146 (2002).
S. B. Cooper and X. Yi, “Isolated d-r. e. degrees,”Preprint No. 17 (Univ. of Leeds, Dept. of Pure Math., 1995).
Sh. Ishmukhametov, “On the r. e. predecessors of d. r. e. degrees,” Arch.Math. Logic 38, 373–386 (1999).
S. Lempp and A. Nies, “Differences of computably enumerable sets,” Math. Logic Quart. 46, 555–561 (2000).
J. Liu, G. Wu and M. Yamaleev, “Downward density of exact degrees,” Lobachevskii J. Math. 36, 389–398 (2015).
R. Robinson, “Interpolation and embedding in the recursively enumerable degrees,” Ann.Math. 93, 586–596 (1971).
G. Wu and M. M. Yamaleev, “Isolation: motivations and applications,” Uch. Zap. Kazan. Univ., Ser. Fiz.-Mat. Nauki 154, 204–217 (2012).
M. M. Yamaleev, “Splitting of 2-computably enumerable degrees with avoiding cones,” Russ. Math. (Iz. VUZ) 6, 76–80 (2009).
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by A. M. Elizarov
Rights and permissions
About this article
Cite this article
Arslanov, M.M., Yamaleev, M.M. On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy. Lobachevskii J Math 39, 634–638 (2018). https://doi.org/10.1134/S1995080218050037
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080218050037