Embedding distributive lattices in the \(\Sigma ^0_2\) enumeration degrees (Q2907055)

Using the notion of Kalimullin pairs (\(\mathcal K\)-pairs), the following interesting results are obtained.NEWLINENEWLINE 1. Every countable distributive lattice is embeddable into \([\mathbf 0_e, \mathbf 0'_e]\) preserving both least and greatest elements. Moreover, the range of the embedding contains only low quasiminimal enumeration degrees, except for the image of the least and greatest elements.NEWLINENEWLINE2. Every countable distributive lattice is embeddable preserving the least element into every nontrivial interval \([a, b] \subseteq \mathcal G_e\) (where \(\mathcal G_e\) is the local structure of the enumeration degrees), for which \(\mathbf {a,b}\) are \(\pmb \Delta_2^0\) enumeration degrees and \(\mathbf a\) is low. Moreover, the range of the embedding contains only enumeration degrees quasiminimal and low over \(\mathbf a\), except for the image of the least and greatest elements.