Computable numberings of the class of Boolean algebras with distinguished endomorphisms

DOI10.1007/S10469-013-9247-4zbMATH Open1337.03063OpenAlexW2016995734MaRDI QIDQ893075FDOQ893075

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

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

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)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes
• Boolean Algebras with Distinguished Endomorphisms and Generating Trees

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)