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

DOI10.1007/s10469-013-9224-yzbMath1315.03053MaRDI 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 spectrum; degree of categoricity; computable categoricity; Boolean algebra with distinguished automorphism

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

06E25: Boolean algebras with additional operations (diagonalizable algebras, etc.)

03C57: Computable structure theory, computable model theory

03C35: Categoricity and completeness of theories

Related Items

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