Skip to main content
Log in

The minimality of certain decidability conditions for Boolean algebras

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We complete our study of the decidability of Boolean algebras in terms of computability of a certain sequence of canonical ideals. We present a proof of the minimality of the conditions obtained for the decidability of Boolean algebras of all elementary characteristics.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Google Scholar 

  2. 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).

    MathSciNet  MATH  Google Scholar 

  3. Goncharov S. S., “Restricted theories of constructive Boolean algebras, ” Siberian Math. J., 17, No. 4, 601–611 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  4. Goncharov S. S., “Some properties of the constructivization of Boolean algebras, ” Siberian Math. J., 16, No. 2, 203–214 (1975).

    Article  MATH  Google Scholar 

  5. Odintsov S.P., Bounded Theories of Constructive Boolean Algebras of the Lower Layer [Preprint, No. 21], Inst. Mat., Novosibirsk (1986).

    Google Scholar 

  6. Vlasov V. N., “Constructivizability of Boolean algebras of elementary characteristic (1, 0, 1), ” Algebra and Logic, 37, No. 5, 279–293 (1998).

    Article  MathSciNet  Google Scholar 

  7. Alaev P. E., “Decidable Boolean algebras of elementary characteristic (1, 0, 1), ” Mat. Tr., 7, No. 1, 3–12 (2004).

    MathSciNet  MATH  Google Scholar 

  8. Alaev P. E., “Strongly constructive Boolean algebras, ” Algebra and Logic, 44, No. 1, 1–12 (2005).

    Article  MathSciNet  Google Scholar 

  9. Leontyeva M. N., “Boolean algebras of elementary characteristic (1, 0, 1) with a countable set of atoms and ideal of atomic elements, ” Vestnik NGU Ser. Mat. Mekh. Informat., 10, No. 1, 64–68 (2010).

    Google Scholar 

  10. Leontyeva M. N., “Sufficient conditions for deciding Boolean algebras, ” Vestnik NGU Ser. Mat. Mekh. Informat. (to be published).

  11. Alaev P. E., “Computable homogeneous Boolean algebras and a metatheorem, ” Algebra and Logic, 43, No. 2, 73–87 (2004).

    Article  MathSciNet  Google Scholar 

  12. Leontyeva M. N., “Boolean algebras of elementary characteristic (1, 0, 1) whose set of atoms and Ershov-Tarski ideal are computable, ” Algebra and Logic, 50, No. 2, 93–105 (2011).

    Article  MathSciNet  Google Scholar 

  13. Ash C. J. and Knight J. F., Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam (2000).

    MATH  Google Scholar 

  14. Alaev P. E., “Hyperarithmetical Boolean algebras with a distinguished ideal, ” Siberian Math. J., 45, No. 5, 795–805 (2004).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. N. Leontyeva.

Additional information

Original Russian Text Copyright © 2012 Leontyeva M. N.

The author was supported by the Russian Foundation for Basic Research (Grant 11-01-00236).

__________

Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 53, No. 1, pp. 132–147, January–February, 2012.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leontyeva, M.N. The minimality of certain decidability conditions for Boolean algebras. Sib Math J 53, 106–118 (2012). https://doi.org/10.1134/S0037446612010090

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation