Branching in the enumeration degrees of the _2⁰ sets
From MaRDI portal
Publication:1293973
DOI10.1007/BF02808174zbMATH Open0924.03080OpenAlexW2004547606MaRDI QIDQ1293973FDOQ1293973
Publication date: 15 September 1999
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02808174
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- The \(n\)-rea enumeration degrees are dense
- Jumps of quasi-minimal enumeration degrees
- Reducibility and Completeness for Sets of Integers
- Title not available (Why is that?)
- On minimal pairs of enumeration degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- The density of the nonbranching degrees
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Title not available (Why is that?)
- The density of infima in the recursively enumerable degrees
- Embedding the diamond in the Σ2 enumeration degrees
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-cuppable enumeration degrees via finite injury
- Embedding finite lattices into the Σ20 enumeration degrees
- On the symmetric enumeration degrees
- Properly Σ2 Enumeration Degrees
- Title not available (Why is that?)
- The limitations of cupping in the local structure of the enumeration degrees
- Diamond embeddings into the enumeration degrees
- Title not available (Why is that?)
- Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
This page was built for publication: Branching in the enumeration degrees of the \(\Sigma_2^0\) sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293973)