Lattice embeddings into the recursively enumerable degrees. II

DOI10.2307/2274738zbMath0687.03022OpenAlexW2503562141MaRDI QIDQ4205431

Ambos-Spies, Klaus, Manuel Lerman

Publication date: 1989

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

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

zbMATH Keywords

embeddabilityposet of r.e. degrees

Mathematics Subject Classification ID

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

Related Items (14)

A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees ⋮ Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991 ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility ⋮ Initial segments of the lattice of ideals of r.e. degrees ⋮ Structural theory of degrees of unsolvability: advances and open problems ⋮ Generalized nonsplitting in the 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 ⋮ Lattice nonembeddings and initial segments 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 ⋮ Splitting theorems in recursion theory

Cites Work

• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• Not every finite lattice is embeddable in the recursively enumerable degrees
• Sublattices of the Recursively Enumerable Degrees

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