Boolean algebras with finite families of computable automorphisms

MaRDI QIDQ5482028zbMATHFDO

Authors B. Kasymkanuly, Andrei S. Morozov

Publication date 24 August 2006

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

recursive functionrecursive model theoryeffective computabilitygroups of computable automorphisms

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Structure theory of Boolean algebras (06E05)

Recommendations

• Boolean algebras of elementary characteristic \((1, 0, 1)\) with computable set of atoms and computable ideal of atomic elements
• Automorphisms of constructivizations of Boolean algebras
• On Boolean Algebras and their Recursive Completions
• scientific article; zbMATH DE number 4193662
• Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism

Cited in

(5)

• Boolean algebra approximations
• Automorphisms of Boolean algebras determined by fixed points
• Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism
• scientific article; zbMATH DE number 2154086 (Why is no real title available?)
• Computable isomorphisms of Boolean algebras with operators

This page was built for publication: Boolean algebras with finite families of computable automorphisms

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