Computable numberings of the class of Boolean algebras with distinguished endomorphisms

DOI10.1007/S10469-013-9247-4zbMath1337.03063OpenAlexW2016995734MaRDI QIDQ893075

Nikolay Bazhenov

Publication date: 13 November 2015

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

Full work available at URL: https://doi.org/10.1007/s10469-013-9247-4

zbMATH Keywords

index setisomorphism problemcomputable numberingcomputable Boolean algebra with distinguished endomorphismsFriedberg numbering

Mathematics Subject Classification ID

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

Related Items (2)

Boolean Algebras with Distinguished Endomorphisms and Generating Trees ⋮ The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes

Cites Work

• The isomorphism problem for classes of computable fields
• Complexity of the index set of a constructive model
• Index sets for some classes of structures
• Autostability of models and Abelian groups
• Computable structures and the hyperarithmetical hierarchy
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Boolean algebras, Tarski invariants, and index sets
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Classification from a Computable Viewpoint
• Index sets of computable structures
• The class of projective planes is noncomputable
• On the complexity of categoricity in computable structures
• Index sets for classes of high rank structures
• Comparing Classes of Finite Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable numberings of the class of Boolean algebras with distinguished endomorphisms