|
Sibirskii Matematicheskii Zhurnal, 2008, Volume 49, Number 6, Pages 1296–1309
(Mi smj1919)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Restrictions on the degree spectra of algebraic structures
I. Sh. Kalimullin Kazan State University, Faculty of Mechanics and Mathematics
Abstract:
We construct the degree $\mathbf b\le\mathbf 0''$ admitting no algebraic structure with degree spectrum $\{\mathbf x\colon\mathbf x\nleq\mathbf b\}$. Moreover, we solve Miller's problem of distinguishing incomparable degrees by the spectra of linear orderings.
Keywords:
computable algebraic structure, computably enumerable set, Turing degree, relative computability.
Received: 15.05.2007
Citation:
I. Sh. Kalimullin, “Restrictions on the degree spectra of algebraic structures”, Sibirsk. Mat. Zh., 49:6 (2008), 1296–1309; Siberian Math. J., 49:6 (2008), 1034–1043
Linking options:
https://www.mathnet.ru/eng/smj1919 https://www.mathnet.ru/eng/smj/v49/i6/p1296
|
Statistics & downloads: |
Abstract page: | 311 | Full-text PDF : | 99 | References: | 45 |
|