|
Sibirskii Matematicheskii Zhurnal, 2007, Volume 48, Number 5, Pages 1167–1179
(Mi smj1799)
|
|
|
|
This article is cited in 22 scientific papers (total in 22 papers)
Index sets of decidable models
E. B. Fokina Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
We study the index sets of the class of $d$-decidable structures and of the class of $d$-decidable countably categorical structures, where $d$ is an arbitrary arithmetical Turing degree. It is proved that the first of them is $m$-complete $\Sigma^{0,d}_3$, and the second is $m$-complete $\Sigma^{0,d}_3\setminus\Sigma^{0,d}_3$ in the universal computable numbering of computable structures for the language with one binary predicate.
Keywords:
index set, computable structure, decidable structure, countably categorical theory.
Received: 07.11.2006
Citation:
E. B. Fokina, “Index sets of decidable models”, Sibirsk. Mat. Zh., 48:5 (2007), 1167–1179; Siberian Math. J., 48:5 (2007), 939–948
Linking options:
https://www.mathnet.ru/eng/smj1799 https://www.mathnet.ru/eng/smj/v48/i5/p1167
|
Statistics & downloads: |
Abstract page: | 391 | Full-text PDF : | 114 | References: | 43 |
|