A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees

Manuel Lerman. A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees. Annals of Pure and Applied Logic, 101(2-3):275-297, 2000.

@article{Lerman00,
  title = {A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees},
  author = {Manuel Lerman},
  year = {2000},
  researchr = {https://researchr.org/publication/Lerman00},
  cites = {0},
  citedby = {0},
  journal = {Annals of Pure and Applied Logic},
  volume = {101},
  number = {2-3},
  pages = {275-297},
}