A computably categorical structure whose expansion by a constant has infinite computable dimension

Journal of Symbolic Logic 68 (4):1199-1241 (2003)
Abstract
Cholak, Goncharov, Khoussainov, and Shore [1] showed that for each k > 0 there is a computably categorical structure whose expansion by a constant has computable dimension k. We show that the same is true with k replaced by ω. Our proof uses a version of Goncharov's method of left and right operations
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1067620182
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 33,190
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total downloads
172 ( #31,809 of 2,242,320 )

Recent downloads (6 months)
3 ( #156,295 of 2,242,320 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature