Lattice embeddings into the recursively enumerable degrees

DOI10.2307/2274050zbMath0633.03037OpenAlexW4240602437MaRDI QIDQ3770516

Ambos-Spies, Klaus, Manuel Lerman

Publication date: 1986

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274050

zbMATH Keywords

embeddingsfinite latticesrecursively enumerable degreesuppersemilatticenonembeddability theorem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (17)

Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Non-p-generic and strongly nonbranching degree ⋮ A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Non-p-generic and strongly nonbranching degree ⋮ Initial segments of the lattice of ideals of r.e. degrees ⋮ Lowness for isomorphism, countable ideals, and computable traceability ⋮ Structural theory of degrees of unsolvability: advances and open problems ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees ⋮ The distribution of the generic recursively enumerable degrees ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element ⋮ Turing computability: structural theory ⋮ Lattice nonembeddings and intervals of the recursively enumerable degrees ⋮ Degree Structures: Local and Global Investigations ⋮ A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees ⋮ On the existence of a strong minimal pair ⋮ Splitting theorems in recursion theory

This page was built for publication: Lattice embeddings into the recursively enumerable degrees