Embedding distributive lattices in the Formula enumeration degrees
Hristo Ganchev, Mariya I. Soskova · Journal of Logic and Computation · 2010
We prove that every countable distributive lattice is embeddable in the Σ02 enumeration degrees via a 0—1 preserving monomorphism. Moreover, we prove that every countable distributive lattice is embeddable below arbitrary Δ02 degree via a 0 preserving monomorphism.