This is a preview of subscription content, log in via an institution to check access.
References
S. S. Goncharov, Countable Boolean Algebras and Decidability [in Russian], Nauchnaya Kniga, Novosibirsk (1996).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1986).
J. D. Monk, “Automorphism groups,” in: Handbook of Boolean Algebras, North-Holland, Amsterdam New York, Oxford, and Tokyo, 1989, Vol. 2, Chapter 14, pp. 517–546.
M. Rubin, “On the reconstruction of Boolean algebras from their automorphism groups,” in: Handbook of Boolean Algebras, North-Holland, Amsterdam, New York, Oxford, and Tokyo, 1989, Vol. 2, Chapter 15, pp. 547–606.
P. Stepanek, “Embeddings and automorphisms,” in: Handbook of Boolean Algebras, North-Holland, Amsterdam, New York, Oxford, and Tokyo, 1989, Vol. 2, Chapter 16, pp. 607–635.
A. S. Morozov, “Groups of computable automorphisms,” in: Handbook of Recursive Mathematics, 1998, Vol. 1, Elsevier, pp. 311–345.
J. B. Remmel, “Recursive Boolean algebras,” in: Handbook of Boolean Algebras, North-Holland, Amsterdam, New York, Oxford, and Tokyo, 1989, Vol. 3, Chapter 25, pp. 1097–1165.
A. S. Morozov, “Groups of recursive automorphisms of constructive Boolean algebras,” Algebra i Logika,22, No. 2, 138–158 (1983).
B. K. Dauletbaev, “Automorphisms of Boolean algebras which are recursive over atoms,” in: Abstracts: 10 All-Union Conference on Mathematical Logic, Alma-Ata, 1990, p. 54.
Additional information
Kostanaî. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 40, No. 3, pp. 561–566, May–June, 1999.
Rights and permissions
About this article
Cite this article
Kasymkanuly, B. Automorphisms of boolean algebras which are recursive over atoms. Sib Math J 40, 478–482 (1999). https://doi.org/10.1007/BF02679754
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02679754