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