Abstract
In this paper we investigate computable isomorphisms of Boolean algebras with operators (BAOs). We prove that there are examples of polymodal Boolean algebras with finitely many computable isomorphism types. We provide an example of a polymodal BAO such that it has exactly one computable isomorphism type but whose expansions by a constant have more than one computable isomorphism type. We also prove a general result showing that BAOs are complete with respect to the degree spectra of structures, computable dimensions, expansions by constants, and the degree spectra of relations.
Similar content being viewed by others
References
Cholak P., Goncharov S., Khoussainov B., Shore R.: Computably categorical structures and expansions by constants. Journal of Symbolic Logic 64, 13–37 (1999)
Dzgoev V., Goncharov S.: Autostability of models. Algebra and Logic 19, 45–53 (1980)
Hirschfeldt D., Khoussainov B., Shore R., Slinko A.: Degree spectra and computable dimension in algebraic structures. Annals of Pure and Applied Logic 115, 71–113 (2002)
Goldblatt R.: Algebraic Polymodal Logic: A Survey. Logic Journal of the IGPL 8(4), 393–450 (2000)
Goncharov S.: The problem of the number of non-self-equivalent constructivizations. Algebra and Logic 19, 621–639 (1988)
Goncharov S., Lempp S., Solomon R.: The computable dimension of ordered Abelian groups. Advances of Mathematics 175, 102–143 (2003)
Jónsson B., Tarski A.: Boolean algebras with operators. Part I. American Journal of Mathematics 73, 891–939 (1951)
Kracht M., Wolter F.: Normal modal logics can simulate all others. Journal of Symbolic Logic 64, 99–138 (1999)
Millar T.: Recursive categoricity and persistence. Journal of Symbolic Logic 51, 430–434 (1986)
Remmel J.: Recursive isomorphism types of recursive Boolean algebras. Journal of Symbolic Logic 46, 572–593 (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Khoussainov, B., Kowalski, T. Computable Isomorphisms of Boolean Algebras with Operators. Stud Logica 100, 481–496 (2012). https://doi.org/10.1007/s11225-012-9411-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-012-9411-1