Computable numberings of the class of Boolean algebras with distinguished endomorphisms

DOI10.1007/S10469-013-9247-4MaRDI QIDQ893075zbMATH OpenOpenAlexFDO

Authors 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

isomorphism problemindex setcomputable numberingcomputable Boolean algebra with distinguished endomorphismsFriedberg numbering

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1534579
• scientific article; zbMATH DE number 1873427
• Boolean algebras with distinguished endomorphisms and generating trees
• scientific article; zbMATH DE number 1746562
• scientific article; zbMATH DE number 2154083

Cites work

• scientific article; zbMATH DE number 5379427 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 1746562 (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?)
• Autostability of models and Abelian groups
• Autostability of the Boolean algebra \(B_\omega\), enriched with an automorphism
• Boolean algebras, Tarski invariants, and index sets
• Classification from a Computable Viewpoint
• Comparing Classes of Finite Structures
• Complexity of some natural problems on the class of computable \(I\)-algebras
• Complexity of the index set of a constructive model
• Computable structures and the hyperarithmetical hierarchy
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Estimation of the algorithmic complexity of classes of computable models
• Index sets for classes of high rank structures
• Index sets for some classes of structures
• Index sets of computable structures
• On the complexity of categoricity in computable structures
• The class of projective planes is noncomputable
• The isomorphism problem for classes of computable fields
• The isomorphism problem for computable Abelian _p-groups of bounded length

Cited in

(3)

• scientific article; zbMATH DE number 1873427 (Why is no real title available?)
• Boolean algebras with distinguished endomorphisms and generating trees
• The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes

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

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