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

DOI10.1016/S0168-0072(99)00021-4zbMath0945.03062MaRDI 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 degree; computably enumerable sets; lattice embeddings; good blocked target arrays; principally decomposable finite lattice

Mathematics Subject Classification ID

06B15: Representation theory of lattices

03D25: Recursively (computably) enumerable sets and degrees

Related Items

Embedding finite lattices into the ideals of computably enumerable turing degrees, The ∀∃-theory of ℛ(≤,∨,∧) is undecidable, On the existence of a strong minimal pair, 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

Cites Work

• 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
• Unnamed Item