Sibirskii Matematicheskii Zhurnal
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sibirsk. Mat. Zh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sibirsk. Mat. Zh., 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

Full text: PDF file (216 kB)
References: PDF file   HTML file

English version:
Siberian Mathematical Journal, 2006, 47:2, 291–297

Bibliographic databases:

UDC: 510.53, 512.563
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

Citation in format AMSBIB
\Bibitem{Kog06}
\by N.~T.~Kogabaev
\paper Complexity of some natural problems on the class of computable $I$-algebras
\jour Sibirsk. Mat. Zh.
\yr 2006
\vol 47
\issue 2
\pages 352--360
\mathnet{http://mi.mathnet.ru/smj860}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2227981}
\zmath{https://zbmath.org/?q=an:1115.03050}
\transl
\jour Siberian Math. J.
\yr 2006
\vol 47
\issue 2
\pages 291--297
\crossref{https://doi.org/10.1007/s11202-006-0041-6}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000236747400007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-33645289388}


Linking options:
  • http://mi.mathnet.ru/eng/smj860
  • http://mi.mathnet.ru/eng/smj/v47/i2/p352

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. N. A. Bazhenov, “Computable numberings of the class of Boolean algebras with distinguished endomorphisms”, Algebra and Logic, 52:5 (2013), 355–366  mathnet  crossref  mathscinet  isi
  • Сибирский математический журнал Siberian Mathematical Journal
    Number of views:
    This page:229
    Full text:64
    References:35

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021