Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy

DOI10.3103/S1066369X10120066zbMath1225.03052OpenAlexW2002670889MaRDI QIDQ646830

M. Kh. Faizrakhmanov

Publication date: 18 November 2011

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

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

zbMATH Keywords

Turing jumpErshov hierarchyconstructive ordinal2-computably enumerable degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)

Related Items (3)

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ Turing computability: structural theory

Cites Work

• The d.r.e. degrees are not dense
• The recursively enumerable degrees are dense
• D.R.E. Degrees and the Nondiamond Theorem
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy