Computable categoricity of the Boolean algebra B( ) with a distinguished automorphism

DOI10.1007/S10469-013-9224-YMaRDI QIDQ384395zbMATH OpenOpenAlexFDO

Authors R. R. Tukhbatullina, Nikolay Bazhenov

Publication date 27 November 2013

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

Full work available at URL https://doi.org/10.1007/s10469-013-9224-y

zbMATH Keywords

Boolean algebra with distinguished automorphismcategoricity spectrumcomputable categoricitydegree of categoricity

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

Recommendations

• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• On ^0_2-categoricity of Boolean algebras
• Computably categorical Boolean algebras enriched by ideals and atoms
• Degrees of autostability relative to strong constructivizations for Boolean algebras
• Boolean algebras with finite families of computable automorphisms

Cites work

• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Autostability of models
• Autostability of the Boolean algebra B_, enriched with an automorphism
• Autostable I-Algebras
• Computable structures and the hyperarithmetical hierarchy
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Effective procedures in field theory
• Enumerations in computable structure theory
• scientific article; zbMATH DE number 1873435 (Why is no real title available?)
• scientific article; zbMATH DE number 934728 (Why is no real title available?)
• scientific article; zbMATH DE number 1390542 (Why is no real title available?)
• Intrinsic bounds on complexity and definability at limit levels
• On ^0_2-categoricity of Boolean algebras
• Recursive isomorphism types of recursive Boolean algebras

Cited in

(7)

• Categoricity for primitive recursive and polynomial Boolean algebras
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• scientific article; zbMATH DE number 6261978 (Why is no real title available?)
• On ^0_2-categoricity of Boolean algebras
• Boolean algebras with finite families of computable automorphisms
• Boolean algebras with distinguished endomorphisms and generating trees
• Computably categorical Boolean algebras enriched by ideals and atoms

This page was built for publication: Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism

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