RUS  ENG
Full version
JOURNALS // Algebra i logika // Archive

Algebra Logika, 2010 Volume 49, Number 1, Pages 98–134 (Mi al430)

This article is cited in 7 papers

Simple structures with complex symmetry

V. Harizanova, R. Millerbc, A. S. Morozovd

a Dep. Math., George Washington Univ.,Washington, DC, USA
b Ph.D. Prog. Math. and Comp. Sci., C.U.N.Y. Graduate Center, New York, USA
c Dep. Math. Queens College – C.U.N.Y., New York, USA
d Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia

Abstract: We define the automorphism spectrum of a computable structure $\mathcal M$, a complexity measure of the symmetries of $\mathcal M$, and prove that certain sets of Turing degrees can be realized as automorphism spectra, while certain others cannot.

Keywords: complexity measure of symmetries of computable structure, automorphism spectrum.

UDC: 510.5+510.67

Received: 14.09.2009


 English version:
Algebra and Logic, 2010, 49:1, 68–90

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025