On the r. e. predecessors of d. r. e. degrees

DOI10.1007/S001530050132zbMath0942.03049OpenAlexW2118490094MaRDI QIDQ1306796

Sh. T. Ishmukhametov

Publication date: 23 August 2000

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050132

zbMATH Keywords

d.r.e. degreesrecursively enumerable degreesT-degrees\(n\)-r.e. degrees\(n\)-REA degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (10)

Downward density of exact degrees ⋮ Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ Nonexistence of Minimal Pairs in $$L[{\mathbf d}$$] ⋮ On a problem of Ishmukhametov ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ Nondensity of Double Bubbles in the D.C.E. Degrees ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ On the problem of definability of the computably enumerable degrees in the difference hierarchy ⋮ Turing computability: structural theory ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02

This page was built for publication: On the r. e. predecessors of d. r. e. degrees