Name
Title | ||
|---|---|---|
A computably categorical structure whose expansion by a constant has infinite computable dimension |
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 omega. Our proof uses a version of Goncharov's method of left and right operations. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.2178/jsl/1067620182 | JOURNAL OF SYMBOLIC LOGIC |
DocType | Volume | Issue |
Journal | 68 | 4 |
ISSN | Citations | PageRank |
0022-4812 | 5 | 0.56 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Denis R. Hirschfeldt | 1 | 207 | 29.32 |
| Bakhadyr Khoussainov | 2 | 604 | 72.96 |
| Richard A. Shore | 3 | 331 | 58.12 |