|
Sibirskii Matematicheskii Zhurnal, 2006, Volume 47, Number 2, Pages 352–360
(Mi smj860)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Complexity of some natural problems on the class of computable $I$-algebras
N. T. Kogabaev Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
We study computable Boolean algebras with distinguished ideals ($I$-algebras for short). We prove that the isomorphism problem for computable $I$-algebras is $\Sigma_1^1$-complete and show that the computable isomorphism problem and the computable categoricity problem for computable $I$-algebras are $\Sigma_3^0$-complete.
Keywords:
computable Boolean algebra with distinguished ideals, computable isomorphism, computably categorical structure, arithmetical complexity, analytical complexity.
Received: 01.02.2005
Citation:
N. T. Kogabaev, “Complexity of some natural problems on the class of computable $I$-algebras”, Sibirsk. Mat. Zh., 47:2 (2006), 352–360; Siberian Math. J., 47:2 (2006), 291–297
Linking options:
https://www.mathnet.ru/eng/smj860 https://www.mathnet.ru/eng/smj/v47/i2/p352
|
Statistics & downloads: |
Abstract page: | 321 | Full-text PDF : | 85 | References: | 59 |
|