A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees

DOI10.1016/S0168-0072(99)00021-4zbMath0945.03062OpenAlexW2006815369MaRDI QIDQ1964021

Manuel Lerman

Publication date: 8 October 2000

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(99)00021-4

zbMATH Keywords

computably enumerable degreecomputably enumerable setslattice embeddingsgood blocked target arraysprincipally decomposable finite lattice

Mathematics Subject Classification ID

Representation theory of lattices (06B15) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ Embedding finite lattices into the ideals of computably enumerable turing degrees ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees ⋮ Degree Structures: Local and Global Investigations ⋮ On the existence of a strong minimal pair

Cites Work

• Unnamed Item
• Lattice nonembeddings and initial segments of 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
• Lattice embeddings into the recursively enumerable degrees

This page was built for publication: A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees