Groups of recursive automorphisms of constructive Boolean algebras

DOI10.1007/BF01978663MaRDI QIDQ800354zbMATH OpenOpenAlexFDO

Authors Andrei S. Morozov

Publication date 1983

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/187212

zbMATH Keywords

constructive Boolean algebragroups of recursive authomorphisms

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Theory of numerations, effectively presented structures (03D45) Structure theory of lattices (06B05) Infinite automorphism groups (20B27)

Review text

The author uses terminology and notations from \textit{Yu. L. Ershov}'s monograph Decision problems and constructivizable models (Russian) (1980; Zbl 0495.03009). An automorphism \(\phi\) of a constructive Boolean algebra (B.a.) (B,\(\nu)\) is said to be recursive if there exists a general recursive function f such that \(\phi\nu =\nu f\). Such automorphisms form the group \(Aut_ r(B,\nu)\). It is known that for any countable B.a. B the group Aut(B) implies rich information on B. In the present paper it is shown that some algebraic and algorithmic properties of a constructive B.a. (B,\(\nu)\) may be reconstructed by \(Aut_ r(B,\nu)\). The main results of this paper are the following: 1. If a constructive B.a. (B,\(\nu)\) has an atomless element then \(Aut_ r(B,\nu)\) is not constructivizable. 2. Let (B,\(\nu)\) be a constructive B.a. such that the set of its atoms and the set of its atomless elements are recursive. Then \(Aut_ r(B,\nu)\) is constructivizable iff B is finite. Let \((B_ 1,\nu_ 1)\) and \((B_ 2,\nu_ 2)\) be atomic strongly constructive B.a. Then \(Aut_ r(B_ 1,\nu_ 1)\cong Aut_ r(B_ 2,\nu_ 2)\) implies \((B_ 1,\nu_ 1)\cong (B_ 2,\nu_ 2).\) 4. There exist non-isomorphic strongly constructive B.a. with isomorphic groups of recursive authomorphisms. 5. There exist Boolean algebras \(B_ 1\) and \(B_ 2\) such that \(B_ 1\) is strongly constructivizable, \(B_ 2\) is non-constructivizable, and \(Aut(B_ 1)\cong Aut(B_ 2).\)

Recommendations

• Automorphisms of constructivizations of Boolean algebras
• scientific article; zbMATH DE number 3853049
• Constructive homogeneous extensions
• Strongly constructive Boolean algebras
• Effective choice of constructivizations and recursive consistency of problems on constructive models
• Effective choice for relations and reducibilities in classes of constructive and positive models
• On effective choice of constructivizations
• scientific article; zbMATH DE number 4118367
• scientific article; zbMATH DE number 1302871
• scientific article; zbMATH DE number 1302878

Cites work

• On the automorphism groups of countable Boolean algebras
• On the automorphism groups of denumerable Boolean algebras
• On the automorphism groups of homogeneous and saturated Boolean algebras

Cited in

(11)

• Constructive Boolean algebras with almost-identical automorphisms
• Automorphisms of constructivizations of Boolean algebras
• Computable groups of automorphisms of models
• Theory of Boolean algebras with a locally finite group of automorphisms
• Recursively rigid Boolean algebras
• Automorphisms of Boolean algebras which are recursive over atoms
• Combinatorial and recursive aspects of the automorphism group of the countable atomless Boolean algebra
• scientific article; zbMATH DE number 4059469 (Why is no real title available?)
• scientific article; zbMATH DE number 3893167 (Why is no real title available?)
• scientific article; zbMATH DE number 4193662 (Why is no real title available?)
• Partial automorphism semigroups

This page was built for publication: Groups of recursive automorphisms of constructive Boolean algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800354)