RUS  ENG
Full version
JOURNALS // Sibirskii Matematicheskii Zhurnal // Archive

Sibirsk. Mat. Zh., 2008 Volume 49, Number 6, Pages 1296–1309 (Mi smj1919)

This article is cited 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.

UDC: 510.53

Received: 15.05.2007


 English version:
Siberian Mathematical Journal, 2008, 49:6, 1034–1043

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024