Minimal covers and arithmetical sets

If $a$ and $b$ are degrees of unsolvability, $a$ is called a minimal cover of $b$ if $b < a$ and no degree $c$ satisfies $b < c < a$. The degree $a$ is called a minimal cover if it is a minimal cover of some degree $b$. We prove by a very simple argument that ${0^n}$ is not a minimal cover for any $n$. From this result and the axiom of Borel determinateness (BD) we show that the degrees of arithmetical sets (with their usual ordering) are not elementarily equivalent to all the degrees. We also point out how this latter result can be proved without BD when the jump operation is added to the structures involved.