Let be the lattice of degrees of non-empty subsets
of under Medvedev reducibility. Binns and Simpson proved that
, the free distributive lattice on countably many generators, is
lattice-embeddable below any non-zero element in . Cenzer and
Hinman proved that is dense, by adapting the Sacks Preservation
and Sacks Coding Strategies used in the proof of the density of the c.e.
Turing degrees. With a construction that is a modification of the one by Cenzer
and Hinman, we improve on the result of Binns and Simpson by showing that for
any , we can lattice embed into
strictly between and .
We also note that, in contrast to the infinite injury in the proof of the Sacks
Density Theorem, in our proof all injury is finite, and that this is also true
for the proof of Cenzer and Hinman, if a straightforward simplification is
made.

生成讲解博客的中文版本

生成AI智能校验的中文版本