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

DOI10.3103/S1066369X10120066zbMATH Open1225.03052OpenAlexW2002670889MaRDI QIDQ646830FDOQ646830

Authors: 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

Recommendations

• New Computational Paradigms
• Splitting and jump inversion in the Turing degrees
• A join theorem for the computably enumerable degrees
• Working below a \(low_ 2\) recursively enumerable degree
• Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees

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) Hierarchies of computability and definability (03D55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• The recursively enumerable degrees are dense
• The d.r.e. degrees are not dense
• D.R.E. Degrees and the Nondiamond Theorem
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• Turing computability: structural theory
• A Hierarchy of Turing Degrees
• The Join Levels of the Trotter-Weil Hierarchy Are Decidable
• A Survey of Results on the d-c.e. and n-c.e. Degrees
• Turing Definability in the Ershov Hierarchy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646830)