Embedding finite lattices into the Σ20 enumeration degrees
From MaRDI portal
Publication:4532601
DOI10.2178/jsl/1190150030zbMath1021.03035OpenAlexW1574729047MaRDI QIDQ4532601
Publication date: 29 October 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1190150030
Related Items
Extensions of two constructions of Ahmad ⋮ Diamond embeddings into the enumeration degrees ⋮ The Π3-theory of the -enumeration degrees is undecidable
Cites Work
- Unnamed Item
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Branching in the enumeration degrees of the \(\Sigma_2^0\) sets
- Recursion theory and complexity. Proceedings of the Kazan '97 workshop, Kazan, Russia, July 14--19, 1997
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
- Embedding the diamond in the Σ2 enumeration degrees
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
- On minimal pairs of enumeration degrees
- Sublattices of the Recursively Enumerable Degrees