Computably categorical Boolean algebras enriched by ideals and atoms

DOI10.1016/J.APAL.2011.06.007zbMath1247.03057OpenAlexW2009381700MaRDI QIDQ764268

P. E. Alaev

Publication date: 13 March 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2011.06.007

zbMATH Keywords

Boolean algebrascomputabilitycomputable structurescomputably categorical structures

Mathematics Subject Classification ID

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

Related Items (5)

The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Boolean algebras autostable relative to \(n\)-decidable presentations ⋮ Categoricity spectra of computable structures ⋮ Degree spectra of structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Countably-categorical Boolean algebras with distinguished ideals
• Autostability of models
• Autostability of Boolean algebras with distinguished ideal
• Computable Boolean algebras
• Countably categorical and autostable Boolean algebras with distinguished ideals
• Recursive isomorphism types of recursive Boolean algebras
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Every Low 2 Boolean Algebra has a Recursive Copy
• Autostable I-Algebras

This page was built for publication: Computably categorical Boolean algebras enriched by ideals and atoms