Degrees of categoricity of trees and the isomorphism problem

In this paper, we show that for any computable ordinal α, there exists a computable tree of rank $\alpha +1$ with strong degree of categoricity ${\mathbf{0}}^{(2\alpha )}$ if α is finite, and with strong degree of categoricity ${\mathbf{0}}^{(2\alpha +1)}$ if α is infinite. In fact, these are the greatest possible degrees of categoricity for such trees. For a computable limit ordinal α, we show that there is a computable tree of rank α with strong degree of categoricity ${\mathbf{0}}^{(\alpha )}$ (which equals ${\mathbf{0}}^{(2\alpha )}$). It follows from our proofs that, for every computable ordinal $\alpha >0$, the isomorphism problem for trees of rank α is ${\mathrm{\Pi }}_{2\alpha }^0$‐complete.