The computable dimension of trees of infinite height

Journal of Symbolic Logic 70 (1):111-141 (2005)
We 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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1107298513
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,422
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
C. J. Ash (1987). Categoricity in Hyperarithmetical Degrees. Annals of Pure and Applied Logic 34 (1):1-14.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Michael Moses (2010). The Block Relation in Computable Linear Orders. Notre Dame Journal of Formal Logic 52 (3):289-305.
Jeremy Avigad (2012). Uncomputably Noisy Ergodic Limits. Notre Dame Journal of Formal Logic 53 (3):347-350.
Samuel Alexander (2006). Formulas for Computable and Non-Computable Functions. Rose-Hulman Undergraduate Mathematics Journal 7 (2).

Monthly downloads

Added to index


Total downloads

3 ( #666,220 of 1,924,768 )

Recent downloads (6 months)

1 ( #417,923 of 1,924,768 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.