Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism

DOI10.1007/s10469-013-9224-yzbMath1315.03053OpenAlexW2042668915MaRDI QIDQ384395

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

categoricity spectrumdegree of categoricitycomputable categoricityBoolean algebra with distinguished automorphism

Mathematics Subject Classification ID

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

Related Items (1)

Boolean Algebras with Distinguished Endomorphisms and Generating Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Autostability of models
• Computable structures and the hyperarithmetical hierarchy
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Degrees of categoricity and the hyperarithmetic hierarchy
• Enumerations in computable structure theory
• Degrees of categoricity of computable structures
• Effective procedures in field theory
• Recursive isomorphism types of recursive Boolean algebras
• Intrinsic bounds on complexity and definability at limit levels
• Autostable I-Algebras

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