On relative enumerability of Turing degrees

DOI10.1007/S001530050139MaRDI QIDQ1568706zbMATH OpenOpenAlexFDO

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

Recommendations

• scientific article; zbMATH DE number 4087652
• On the r. e. predecessors of d. r. e. degrees
• On Pairs of Recursively Enumerable Degrees
• Relative enumerability in the difference hierarchy
• Quasi-minimal enumeration degrees and minimal Turing degrees

Cited in

(22)

• A survey of results on the d-c.e. and n-c.e. degrees
• Nonisolated degrees and the jump operator
• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• ∑1-Density and Turing Degrees
• Every Set has a Least Jump Enumeration
• Turing computability: structural theory
• Bounding computably enumerable degrees in the Ershov hierarchy
• Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$
• Iterated relative recursive enumerability
• Complementing cappable degrees in the difference hierarchy.
• A Hierarchy of Turing Degrees
• Turing determinacy and the continuum hypothesis
• Turing degrees of certain isomorphic images of computable relations
• PA RELATIVE TO AN ENUMERATION ORACLE
• On a problem of Ishmukhametov
• Relative enumerability in the difference hierarchy
• scientific article; zbMATH DE number 5504384 (Why is no real title available?)
• 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
• An extension of the recursively enumerable Turing degrees
• scientific article; zbMATH DE number 1390015 (Why is no real title available?)
• scientific article; zbMATH DE number 4055595 (Why is no real title available?)
• Turing Computations On Ordinals

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

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