Embedding finite lattices into the ideals of computably enumerable turing degrees

DOI10.2307/2694975zbMath1002.03035OpenAlexW2010643345MaRDI QIDQ4328834

William C. Calhoun, Manuel Lerman

Publication date: 23 July 2002

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

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

zbMATH Keywords

embeddingcomputably enumerable Turing degreeslattice of ideals

Mathematics Subject Classification ID

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

Related Items (1)

The ∀∃-theory of ℛ(≤,∨,∧) is undecidable

Cites Work

• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees

This page was built for publication: Embedding finite lattices into the ideals of computably enumerable turing degrees