Degrees of categoricity of trees and the isomorphism problem
Mohammad Assem Mahmoud · Mathematical logic quarterly · 2019
Abstract In this paper, we show that for any computable ordinal α, there exists a computable tree of rank with strong degree of categoricity if α is finite, and with strong degree of categoricity 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 (which equals ). It follows from our proofs that, for every computable ordinal , the isomorphism problem for trees of rank α is ‐complete.