Definable relations in Turing degree structures

DOI10.3103/S1066369X1402011XzbMath1327.03031OpenAlexW2011995303WikidataQ128145798 ScholiaQ128145798MaRDI QIDQ468086

Marat M. Arslanov

Publication date: 5 November 2014

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x1402011x

zbMATH Keywords

definable relationscomputably enumerable setsErshov difference hierarchyhigh degreesmajor subsetsTuring degrees of unsolvability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• On the degrees less than 0'
• Automorphisms of the lattice of recursively enumerable sets
• Differences of Computably Enumerable Sets
• ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
• The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Some theorems on R-maximal sets and major subsets of recursively enumerable sets
• The Δ₃⁰-automorphism method and noninvariant classes of degrees