Computable isomorphisms of Boolean algebras with operators

DOI10.1007/S11225-012-9411-1MaRDI QIDQ694494zbMATH OpenOpenAlexFDO

Authors 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 isomorphismBoolean algebra with operatorsdegree spectrum

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

Recommendations

• scientific article; zbMATH DE number 1421070
• Boolean algebras of elementary characteristic \((1, 0, 1)\) with computable set of atoms and computable ideal of atomic elements
• scientific article; zbMATH DE number 2047485
• Complexity of some natural problems on the class of computable \(I\)-algebras
• Boolean algebras with finite families of computable automorphisms

Cites work

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

Cited in

(11)

• HKSS-completeness of modal algebras
• On the effective universality of mereological theories
• Computable Heyting algebras with distinguished atoms and coatoms
• Categoricity spectra of computable structures
• Boolean algebras with distinguished endomorphisms and generating trees
• Effective categoricity for distributive lattices and Heyting algebras
• scientific article; zbMATH DE number 2154086 (Why is no real title available?)
• Categoricity spectra for polymodal algebras
• The completeness of the isomorphism relation for countable Boolean algebras
• COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
• Virtual algebraic isomorphisms between predicate calculi of finite rich signatures

This page was built for publication: Computable isomorphisms of Boolean algebras with operators

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