Abstract
AbstractWe prove that no computable tree of infinite height is computably categorical, and indeed that all such trees have computable dimension ω. Moreover, this dimension is effectively ω, in the sense that given any effective listing of computable presentations of the same tree, we can effectively find another computable presentation of it which is not computably isomorphic to any of the presentations on the list.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. Autostability and computable families of constructivizations
2. Constructive Models
3. On well-quasi-ordering finite trees
4. Well quasi-ordering, the tree theorem, and Vázsonyi's conjecture;Kruskal;Transactions of the American Mathematical Society,1960
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献