Skip to main content
SpringerLink
Log in

The index set of Boolean algebras autostable relative to strong constructivizations

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We obtain exact estimates for the algorithmic complexity for the classes of strongly constructivizable computable models autostable relative to strong constructivizations and belonging to the following natural classes: Boolean algebras, distributive lattices, rings, commutative semigroups, and partial orders.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Goncharov S. S. and Knight J. F., “Computable structure and non-structure theorems,” Algebra and Logic, 41, No. 6, 351–373 (2002).

    Article  MathSciNet  Google Scholar 

  2. Ershov Yu. L. and Goncharov S. S., Constructive Models, Ser. Siberian School of Algebra and Logic, Kluwer Academic/Plenum Publishers, New York, etc. (2000).

    Google Scholar 

  3. Ash C. J. and Knight J. F., Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam (2000) (Stud. Logic Found. Math.; V. 144).

    MATH  Google Scholar 

  4. Nurtazin A. T., Computable Classes and Algebraic Criteria of Autostability [in Russian], Dis. Kand. Fiz.-Mat. Nauk, Inst. Mat. Mekh., Alma-Ata (1974).

    Google Scholar 

  5. Goncharov S. S. and Marchuk M. I., “Index sets of constructive models of bounded signature which are autostable relative to strong constructivizations,” Algebra and Logic (to be published).

  6. Goncharov S. S. and Marchuk M. I., “Index sets of constructive models of finite signature and graph signature which are autostable relative to strong constructivizations,” Algebra and Logic (to be published).

  7. Goncharov S. S. and Marchuk M. I., “Index sets of autostable relative to strong constructivizations constructive models,” Vestnik NGU. Ser. Mat. Mekh. Inform., 13, No. 4, 43–67 (2013).

    Google Scholar 

  8. Marker D., “Non Σn axiomatizable almost strongly minimal theories,” J. Symbolic Logic, 54, No. 3, 921–927 (1989).

    Article  MATH  MathSciNet  Google Scholar 

  9. Goncharov S. S. and Khoussainov B., “Complexity of theories of computable categorical models,” Algebra and Logic, 43, No. 6, 365–373 (2004).

    Article  MathSciNet  Google Scholar 

  10. Ash C. J. and Knight J. F., “Pairs of recursive structures,” Ann. Pure Appl. Logic, 46, No. 3, 211–234 (1990).

    Article  MATH  MathSciNet  Google Scholar 

  11. Goncharov S. S., Countable Boolean Algebras and Decidability [in Russian], Nauchnaya Kniga, Novosibirsk (1996).

    Google Scholar 

  12. Chang C. C. and Keisler H. J., Model Theory, North-Holland, Amsterdam and London (1973).

    MATH  Google Scholar 

  13. Nurtazin A. T., “Strong and weak constructivization and computable families,” Algebra and Logic, 13, No. 3, 177–184 (1974).

    Article  Google Scholar 

  14. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York, St. Louis, San Francisco, Toronto, London, and Sydney (1972).

    MATH  Google Scholar 

  15. Tarski A., “Arithmetical classes and types of Boolean algebras,” Bull. Amer. Math. Soc., 55, 63 (1949).

    Google Scholar 

  16. Ershov Yu. L., “Decidability of the elementary theory of distributive structures with relative complements and the theory of filters,” Algebra i Logika, 3, No. 3, 17–38 (1964).

    MATH  MathSciNet  Google Scholar 

  17. Remmel J. B., “Recursive Boolean algebras,” in: Handbook of Boolean Algebras. V. 3, Elsevier, Amsterdam, etc., 1989, pp. 1097–1165.

    Google Scholar 

  18. Mead J., “Recursive prime models for Boolean algebras,” Colloq. Math., 41, 25–33 (1979).

    MATH  MathSciNet  Google Scholar 

  19. Pal’chunov D. E., Trofimov A. V., and Turko A. I., “Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals,” Siberian Math. J., 56, No. 3, 490–498 (2015).

    Google Scholar 

  20. Csima B. F., Montalbán A., and Shore R. A., “Boolean algebras, Tarski invariants, and index sets,” Notre Dame J. Formal Logic, 47, No. 1, 1–23 (2006).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk State University, Novosibirsk, Russia

    S. S. Goncharov & N. A. Bazhenov

  2. Sobolev Institute of Mathematics, Novosibirsk, Russia

    M. I. Marchuk

Authors
  1. S. S. Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. A. Bazhenov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. I. Marchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. S. Goncharov.

Additional information

Original Russian Text Copyright © 2015 Goncharov S.S., Bazhenov N.A., and Marchuk M.I.

The first author was partially supported by the Russian Foundation for Basic Research (Grant 13-01-91001-ANF-A). The second author was partially supported by the Grant Council of the President of the Russian Federation for the State Maintenance of the Leading Scientific Schools (Grant NSh-860.2014.1). The third author was partially supported by the Russian Foundation for Basic Research (Grant 14-01-00376).

To Yuriĭ Leonidovich Ershov on his 75th birthday.

__________

Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 56, No. 3, pp. 498–512, May–June, 2015; DOI: 10.17377/smzh.2015.56.303.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Goncharov, S.S., Bazhenov, N.A. & Marchuk, M.I. The index set of Boolean algebras autostable relative to strong constructivizations. Sib Math J 56, 393–404 (2015). https://doi.org/10.1134/S0037446615030039

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0037446615030039

Keywords

Search

Navigation