Embedding $FD(\omega)$ into $\mathcal{P}_s$ densely
Joshua A. Cole

TL;DR
This paper demonstrates that the free distributive lattice on countably many generators can be densely embedded into the lattice of non-empty Pi-1^0 subsets of 2^omega under Medvedev reducibility, refining previous results with a finite injury construction.
Contribution
It improves prior embeddings by showing dense lattice embedding of FD(omega) between any two degrees, using a finite injury method.
Findings
Dense embedding of FD(omega) between any two degrees in P_s.
Finite injury construction simplifies previous infinite injury methods.
Enhancement of the understanding of the structure of Medvedev degrees.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · semigroups and automata theory
