Constructive Boolean algebras with almost-identical automorphisms
type: Item
instance of: scholarly article
title: Constructive Boolean algebras with almost-identical automorphisms
zbMATH Open document ID: 0597.03027
DOI: 10.1007/BF01158175
published in: Mathematical Notes
publication date: 1985-01-01T00:00:00Z
review text: An automorphism \(\phi\) of a constructive model (B,\(\nu)\) is called recursive if there exists a recursive function f such that \(\phi \nu =\nu f\). Let \(Aut_ r(B,\mu)\) be the group of all recursive automorphisms of (B,\(\mu)\), Fin be the group of all permutations of \(\omega\) which move only a finite number of elements. In Algebra Logika 22, No.2, 138-158 (1983; Zbl 0549.03031) the author proved that for every atomic strongly constructivizable Boolean algebra B there exists a constructivization \(\mu\) such that \(Aut_ r(B,\mu)\cong Fin\). In the present paper he proves that for every infinite atomic constructive Boolean algebra (B,\(\nu)\) there exists a constructivization \(\mu\) such that \(Aut_ r(B,\mu)\cong Fin\).
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D50
Mathematics Subject Classification ID: 06E99
zbMATH DE Number: 3961595
zbMATH Keywords: constructive model
zbMATH Keywords: recursive automorphisms
zbMATH Keywords: constructivization
author: Andrei S. Morozov
MaRDI profile type: Publication
cites work: Q3958432
full work available at URL: https://doi.org/10.1007/bf01158175
OpenAlex ID: W2086687163
description: scientific article; zbMATH DE number 3961595