Embedding $FD(ω)$ into $\mathcal{P}_s$ densely

Details Embedding $FD(ω)$ into $\mathcal{P}_s$ densely Embedding $FD(ω)$ into $\mathcal{P}_s$ densely

2007-08-30

arxiv.org/abs/0708.4215v1

Mathematics

Logic

14 pages

Scientific paper

Let $\mathcal{P}_s$ be the lattice of degrees of non-empty $\Pi_1^0$ subsets of $2^\omega$ under Medvedev reducibility. Binns and Simpson proved that $FD(\omega)$, the free distributive lattice on countably many generators, is lattice-embeddable below any non-zero element in $\mathcal{P}_s$. Cenzer and Hinman proved that $\mathcal{P}_s$ 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 $\mathcal{U} <_s \mathcal{V}$, we can lattice embed $FD(\omega)$ into $\mathcal{P}_s$ strictly between $deg_s(\mathcal{U})$ and $deg_s(\mathcal{V)}$. 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.

Affiliated with

Also associated with

No associations

Rating

Embedding $FD(ω)$ into $\mathcal{P}_s$ densely does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Embedding $FD(ω)$ into $\mathcal{P}_s$ densely, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedding $FD(ω)$ into $\mathcal{P}_s$ densely will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-206279