A. S. Morozov, B. Kasymkanuly, “Boolean algebras with finite families of computable automorphisms”, Sibirsk. Mat. Zh., 2004, Volume 45, Number 1,Pages <nobr>171

This article is cited in 1 paper

Boolean algebras with finite families of computable automorphisms

A. S. Morozov^a, B. Kasymkanuly^b

^a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
^b A. Baitursynov Kostanai State University

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.

UDC: 517.11

Received: 07.04.2003
Revised: 15.09.2003