Boolean Algebras with Distinguished Endomorphisms and Generating Trees

DOI10.1007/s10958-016-2851-9zbMath1349.03034OpenAlexW2343608417MaRDI QIDQ5741387

Nikolay Bazhenov

Publication date: 22 July 2016

Published in: Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-016-2851-9

zbMATH Keywords

Boolean algebracomputable dimensiondegree spectrumBoolean algebra with distinguished endomorphisms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism
• Computable isomorphisms of Boolean algebras with operators
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms
• Computable single-valued numerations
• Problem of the number of non-self-equivalent constructivizations
• Computable structures and the hyperarithmetical hierarchy
• Constructivizability of superatomic Boolean algebras
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Enumerations in computable structure theory
• Spectra of degrees of some structures
• Almost computably enumerable families of sets
• Degrees coded in jumps of orderings
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees

This page was built for publication: Boolean Algebras with Distinguished Endomorphisms and Generating Trees