Computable isomorphisms of Boolean algebras with operators

DOI10.1007/s11225-012-9411-1zbMath1285.03059MaRDI QIDQ694494

Bakhadyr Khoussainov, Tomasz Kowalski

Publication date: 12 December 2012

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-012-9411-1

zbMATH Keywords

computable isomorphism; Boolean algebra with operators; degree spectrum

Mathematics Subject Classification ID

06E25: Boolean algebras with additional operations (diagonalizable algebras, etc.)

03D45: Theory of numerations, effectively presented structures

Related Items

Boolean Algebras with Distinguished Endomorphisms and Generating Trees, On the effective universality of mereological theories, Computable Heyting algebras with distinguished atoms and coatoms, Categoricity spectra for polymodal algebras, Categoricity spectra of computable structures, HKSS-completeness of modal algebras, Effective categoricity for distributive lattices and Heyting algebras

Cites Work

• Autostability of models
• Degree spectra and computable dimensions in algebraic structures
• The computable dimension of ordered abelian groups
• Recursive isomorphism types of recursive Boolean algebras
• Recursive categoricity and persistence
• Computably categorical structures and expansions by constants
• Normal monomodal logics can simulate all others
• Algebraic polymodal logic: a survey
• Boolean Algebras with Operators. Part I