Goodness in the enumeration and singleton degrees
From MaRDI portal
(Redirected from Publication:992037)
Recommendations
- Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees
- Badness and jump inversion in the enumeration degrees
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
- Limit lemmas and jump inversion in the enumeration degrees
- A note on initial segments of the enumeration degrees
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1048046 (Why is no real title available?)
- scientific article; zbMATH DE number 1421079 (Why is no real title available?)
- Classical recursion theory. The theory of functions and sets of natural numbers
- Degrees of Unsolvability. (AM-55)
- Enumeration reducibility and partial degrees
- Limit lemmas and jump inversion in the enumeration degrees
- On minimal pairs of enumeration degrees
- On the jump classes of noncuppable enumeration degrees
- Partial degrees and the density problem
- Semirecursive Sets and Positive Reducibility
- Strong enumeration reducibilities
- The \(n\)-rea enumeration degrees are dense
- The upper semi-lattice of degrees of recursive unsolvability
- e- and s-degrees
- s-Degrees within e-Degrees
Cited in
(8)- Badness and jump inversion in the enumeration degrees
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
- Limit lemmas and jump inversion in the enumeration degrees
- Enumeration 1-genericity in the local enumeration degrees
- On cototality and the skip operator in the enumeration degrees
- On the jump classes of noncuppable enumeration degrees
- Bounded enumeration reducibility and its degree structure
- Density of the cototal enumeration degrees
This page was built for publication: Goodness in the enumeration and singleton degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992037)
