The Medvedev lattice provides a way to rank the difficulty of mass problems, where a mass problem is a set of functions and solving it means computing any one member. The lattice has rich algebraic structure, and researchers have identified many natural degrees within it. However, a fundamental question remains unresolved: whether there exists an algorithm to decide which first-order sentences are true in this lattice, or equivalently, what the logical complexity of reasoning about Medvedev reducibility actually is. This asks us to understand the full logical portrait of a central object in computable mathematics, not just isolated fragments of it.