On relative enumerability of Turing degrees

DOI10.1007/S001530050139zbMath0951.03037OpenAlexW1995165876MaRDI QIDQ1568706

Sh. T. Ishmukhametov

Publication date: 26 December 2000

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

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

zbMATH Keywords

Turing degreerecursively enumerable degreesd.r.e. degreeREA-degreerelative enumerability

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Turing computability: structural theory ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02

This page was built for publication: On relative enumerability of Turing degrees