Constructive Boolean algebras with almost-identical automorphisms
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\).
- Constructive Boolean algebras with almost-identical automorphisms
- Automorphisms of constructivizations of Boolean algebras
- Automorphisms of Boolean algebras which are recursive over atoms
- Automorphisms of Boolean algebras determined by fixed points
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
- scientific article; zbMATH DE number 4150125 (Why is no real title available?)
- Combinatorial and recursive aspects of the automorphism group of the countable atomless Boolean algebra
- scientific article; zbMATH DE number 7967 (Why is no real title available?)
- Boolean‐Valued Models of Set Theory with Automorphisms
- Autometrized Boolean Algebras I: Fundamental Distance-Theoretic Properties of B
This page was built for publication: Constructive Boolean algebras with almost-identical automorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078560)
