Sublattices of the polynomial time degrees

Abstract

We show that any countable distributive lattice can be embedded in any interval of polynomial time degrees. Furthermore the embeddings can be chosen to preserve the least or the greatest element. This holds for both polynomial time bounded many-one and Turing reducibilities, as well as for all of the common intermediate reducibilities.