Studia Logica

, Volume 100, Issue 3, pp 481–496

Computable Isomorphisms of Boolean Algebras with Operators

Article

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.

Keywords

Computable isomorphism Boolean algebra with operators Degree spectrum 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cholak P., Goncharov S., Khoussainov B., Shore R.: Computably categorical structures and expansions by constants. Journal of Symbolic Logic 64, 13–37 (1999)CrossRefGoogle Scholar
  2. 2.
    Dzgoev V., Goncharov S.: Autostability of models. Algebra and Logic 19, 45–53 (1980)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Goldblatt R.: Algebraic Polymodal Logic: A Survey. Logic Journal of the IGPL 8(4), 393–450 (2000)CrossRefGoogle Scholar
  5. 5.
    Goncharov S.: The problem of the number of non-self-equivalent constructivizations. Algebra and Logic 19, 621–639 (1988)Google Scholar
  6. 6.
    Goncharov S., Lempp S., Solomon R.: The computable dimension of ordered Abelian groups. Advances of Mathematics 175, 102–143 (2003)CrossRefGoogle Scholar
  7. 7.
    Jónsson B., Tarski A.: Boolean algebras with operators. Part I. American Journal of Mathematics 73, 891–939 (1951)CrossRefGoogle Scholar
  8. 8.
    Kracht M., Wolter F.: Normal modal logics can simulate all others. Journal of Symbolic Logic 64, 99–138 (1999)CrossRefGoogle Scholar
  9. 9.
    Millar T.: Recursive categoricity and persistence. Journal of Symbolic Logic 51, 430–434 (1986)CrossRefGoogle Scholar
  10. 10.
    Remmel J.: Recursive isomorphism types of recursive Boolean algebras. Journal of Symbolic Logic 46, 572–593 (1981)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceAuckland UniversityAucklandNew Zealand
  2. 2.Department of Mathematics and StatisticsLa Trobe UniversityBundooraAustralia

Personalised recommendations