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

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

Sibirskii Matematicheskii Zhurnal, 2004, Volume 45, Number 1, Pages 171–177 (Mi smj1056)  
This article is cited in 1 scientific paper (total in 1 paper)

Boolean algebras with finite families of computable automorphisms

A. S. Morozova, B. Kasymkanulyb

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b A. Baitursynov Kostanai State University
Full-text PDF (192 kB) Citations (1)
References:
PDF
HTML
Abstract: We prove that each computable Boolean algebra has a computable presentation in which for every computable family of automorphisms the set of atoms moved by at least one of its members is finite. This implies that each computable atomic Boolean algebra has a computable presentation in which its every computable family of automorphisms is finite. The priority argument is not used in the proof.
Keywords: computable Boolean algebra, constructive Boolean algebra, constructive model, automorphism.
Received: 07.04.2003
Revised: 15.09.2003
English version:
Siberian Mathematical Journal, 2004, Volume 45, Issue 1, Pages 141–145
DOI: https://doi.org/10.1023/B:SIMJ.0000013019.12506.18
Bibliographic databases:
UDC: 517.11
Language: Russian
Citation: A. S. Morozov, B. Kasymkanuly, “Boolean algebras with finite families of computable automorphisms”, Sibirsk. Mat. Zh., 45:1 (2004), 171–177; Siberian Math. J., 45:1 (2004), 141–145
Citation in format AMSBIB
\Bibitem{MorKas04}
\by A.~S.~Morozov, B.~Kasymkanuly
\paper Boolean algebras with finite families of computable automorphisms
\jour Sibirsk. Mat. Zh.
\yr 2004
\vol 45
\issue 1
\pages 171--177
\mathnet{http://mi.mathnet.ru/smj1056}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2048760}
\zmath{https://zbmath.org/?q=an:1097.03038}
\transl
\jour Siberian Math. J.
\yr 2004
\vol 45
\issue 1
\pages 141--145
\crossref{https://doi.org/10.1023/B:SIMJ.0000013019.12506.18}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000189126800012}
Linking options:
  • https://www.mathnet.ru/eng/smj1056
  • https://www.mathnet.ru/eng/smj/v45/i1/p171
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Сибирский математический журнал Siberian Mathematical Journal
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024