Studia Logica

, Volume 104, Issue 6, pp 1083–1097 | Cite as

Categoricity Spectra for Polymodal Algebras

Article

Abstract

We investigate effective categoricity for polymodal algebras (i.e., Boolean algebras with distinguished modalities). We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations. In particular, this implies that every categoricity spectrum is the categoricity spectrum of a polymodal algebra.

Keywords

Polymodal algebra Boolean algebra with operators Categoricity spectrum Autostability spectrum Degree spectrum Turing computable embedding 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ash, C. J., and J. F. Knight, Computable structures and the hyperarithmetical hierarchy, vol. 144 of Studies in Logic and the Foundations of Mathematics, Elsevier Science B.V., Amsterdam etc., 2000.Google Scholar
  2. 2.
    Bazhenov N.A.: \({\Delta_2^0}\)-categoricity of Boolean algebras. Journal of Mathematical Sciences (New York) 203(4), 444–454 (2014)CrossRefGoogle Scholar
  3. 3.
    Bazhenov N.A.: 2-Computably enumerable degrees of categoricity for Boolean algebras with distinguished automorphisms. Journal of Mathematical Sciences (New York) 211(6), 738–746 (2015)CrossRefGoogle Scholar
  4. 4.
    Bazhenov N.A.: Autostability spectra for Boolean algebras. Algebra and Logic 53(6), 502–505 (2015)CrossRefGoogle Scholar
  5. 5.
    Bazhenov N. A., Tukhbatullina R.R.: Constructivizability of the Boolean algebra B(ω) with a distinguished automorphism. Algebra and Logic 51(5), 384–403 (2012)CrossRefGoogle Scholar
  6. 6.
    Calvert W., Cummins D., Knight J. F., Miller S.: Comparing classes of finite structures. Algebra and Logic 43(6), 374–392 (2004)CrossRefGoogle Scholar
  7. 7.
    Csima B.F., Franklin J.N.Y., Shore R.A.: Degrees of categoricity and the hyperarithmetic hierarchy. Notre Dame Journal of Formal Logic, 54(2), 215–231 (2013)CrossRefGoogle Scholar
  8. 8.
    Downey R.G., Kach A.M., Lempp S., Lewis-Pye A.E.M., Montalbán A., Turetsky D.D.: The complexity of computable categoricity. Advances in Mathematics 268, 423–466 (2015)CrossRefGoogle Scholar
  9. 9.
    Ershov, Yu. L., and S. S. Goncharov, Constructive models, Siberian School of Algebra and Logic, Kluwer Academic/Plenum Publishers, New York, 2000.Google Scholar
  10. 10.
    Fokina, E. B., V. Harizanov, and A. Melnikov, Computable model theory, in R. Downey, (ed.), Turing’s Legacy: Developments from Turing Ideas in Logic, vol. 42 of Lecture Notes in Logic, Cambridge University Press, Cambridge, 2014, pp. 124–194.Google Scholar
  11. 11.
    Fokina E.B., Kalimullin I., Miller R.: Degrees of categoricity of computable structures. Archive for Mathematical Logic 49(1), 51–67 (2010)CrossRefGoogle Scholar
  12. 12.
    Friedman H., Stanley L.: A Borel reducibility theory for classes of countable structures. The Journal of Symbolic Logic 54(3), 894–914 (1989)CrossRefGoogle Scholar
  13. 13.
    Fröhlich A., Shepherdson J.C.: Effective procedures in field theory. Philosophical Transactions of the Royal Society of London Series A 248, 407–432 (1956)CrossRefGoogle Scholar
  14. 14.
    Goldblatt R.: Algebraic polymodal logic: a survey. Logic Journal of the IGPL 8(4), 393–450 (2000)CrossRefGoogle Scholar
  15. 15.
    Goncharov, S., and B. Khoussainov, Open problems in the theory of constructive algebraic systems, in P. A. Cholak, S. Lempp, M. Lerman, and R. A. Shore, (eds.), Computability Theory and Its Applications: Current Trends and Open Problems, vol. 257 of Contemporary Mathematics, American Mathematical Society, Providence, RI, 2000, pp. 145–170.Google Scholar
  16. 16.
    Goncharov, S. S., Countable Boolean algebras and decidability, Siberian School of Algebra and Logic, Consultants Bureau, New York, 1997.Google Scholar
  17. 17.
    Goncharov S.S.: Degrees of autostability relative to strong constructivizations. Proceedings of the Steklov Institute of Mathematics 274(1), 105–115 (2011)CrossRefGoogle Scholar
  18. 18.
    Goncharov S.S., Bazhenov N.A., Marchuk M.I.: Index sets of autostable relative to strong constructivizations constructive models for familiar classes. Doklady Mathematics 92(2), 525–527 (2015)CrossRefGoogle Scholar
  19. 19.
    Goncharov S.S., Dzgoev V.D.: Autostability of models. Algebra and Logic 19(1), 28–37 (1980)CrossRefGoogle Scholar
  20. 20.
    Hirschfeldt D. R., Khoussainov B., Shore R.A., Slinko A.M.: Degree spectra and computable dimensions in algebraic structures. Annals of Pure and Applied Logic 115(1–3), 71–113 (2002)CrossRefGoogle Scholar
  21. 21.
    Kalimullin, I., B. Khoussainov, and A. Melnikov, Limitwise monotonic sequences and degree spectra of structures, Proceedings of the American Mathematical Society 141(9):3275–3289, 2013.Google Scholar
  22. 22.
    Khoussainov B., Kowalski T.: Computable isomorphisms of Boolean algebras with operators. Studia Logica 100(3), 481–496 (2012)CrossRefGoogle Scholar
  23. 23.
    Knight J. F.: Degrees coded in jumps of orderings. The Journal of Symbolic Logic 51(4), 1034–1042 (1986)CrossRefGoogle Scholar
  24. 24.
    Knight J. F.: Using computability to measure complexity of algebraic structures and classes of structures. Lobachevskii Journal of Mathematics 35(4), 304–312 (2014)CrossRefGoogle Scholar
  25. 25.
    Knight J. F., Miller S., Vanden Boom M.: Turing computable embeddings. The Journal of Symbolic Logic 72(3), 901–918 (2007)CrossRefGoogle Scholar
  26. 26.
    Kogabaev N. T.: The theory of projective planes is complete with respect to degree spectra and effective dimensions. Algebra and Logic 54(5), 387–407 (2015)CrossRefGoogle Scholar
  27. 27.
    Mal’tsev A. I.: Constructive algebras I. Russian Mathematical Surveys 16(3), 77–129 (1961)CrossRefGoogle Scholar
  28. 28.
    Mal’tsev A. I.: On recursive abelian groups. Soviet Mathematics. Doklady 32, 1431–1434 (1962)Google Scholar
  29. 29.
    Miller R.: d-computable categoricity for algebraic fields. The Journal of Symbolic Logic 74(4), 1325–1351 (2009)CrossRefGoogle Scholar
  30. 30.
    Miller, R., B. Poonen, H. Schoutens, and A. Shlapentokh, A computable functor from graphs to fields. arXiv:1510.07322, 2015.

Copyright information

© Springer Science+Business Media Dordrecht 2016

Authors and Affiliations

  1. 1.Sobolev Institute of MathematicsNovosibirskRussia
  2. 2.Kazan Federal UniversityKazanRussia
  3. 3.Novosibirsk State UniversityNovosibirskRussia

Personalised recommendations