scientific article; zbMATH DE number 5354059
From MaRDI portal
Publication:3530409
Recommendations
- Bounding computably enumerable degrees in the Ershov hierarchy
- Cupping and jump classes in the computably enumerable degrees
- Computable numberings in the hierarchy of Ershov
- Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
- A hierarchy of computably enumerable degrees
- Cupping and definability in the local structure of the enumeration degrees
- Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
- Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
- Relative enumerability in Ershov's hierarchy
- Non-cuppable enumeration degrees via finite injury
Cited in
(9)- Cupping \Delta₂⁰ Enumeration Degrees to 0 e ′
- A survey of results on the d.c.e. and \(n\)-c.e. degrees
- Cupping computably enumerable degrees simultaneously
- Modulo computably enumerable degrees by cupping partners
- Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
- Theory and Applications of Models of Computation
- A survey of results on the d-c.e. and n-c.e. degrees
- A hierarchy for the plus cupping Turing degrees
- Cupping and diamond embeddings: a unifying approach
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3530409)
