Skip to main content
SpringerLink
Log in

Boolean Algebras Autostable Relative to n-Decidable Presentations

  • Published:
Algebra and Logic Aims and scope

We give an algebraic description of Boolean algebras autostable relative to n-decidable presentations. Also, autostable Iλ,μ-algebras are described.

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. S. S. Goncharov and V. D. Dzgoev, “Autostability of models,” Algebra and Logic, 19, No. 1, 28-36 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  2. J. B. Remmel, “Recursive isomorphism types of recursive Boolean algebras,” J. Symb. Log., 46, No. 3, 572-594 (1981).

    Article  MathSciNet  MATH  Google Scholar 

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

  4. E. B. Fokina, S. S. Goncharov, V. Harizanov, O. V. Kudinov, and D. Turetsky, “Index sets for n-decidable structures categorical relative to m-decidable presentations,” Algebra and Logic, 54, No. 4, 336-341 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  5. J. B. Remmel, “Recursive Boolean algebras,” in Handbook of Boolean Algebras, Vol. 3, J. D. Monk and R. Bonnet (Eds.), North-Holland, Amsterdam (1989), pp. 1097-1165.

    Google Scholar 

  6. S. S. Goncharov, Countable Boolean Algebras and Decidability, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1996).

  7. P. E. Alaev, “Computably categorical Boolean algebras enriched by ideals and atoms,” Ann. Pure Appl. Log., 163, No. 5, 485-499 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  8. P. E. Alaev, “Autostable atomic-ideal enrichments of computable Boolean algebras,” Dokl. Akad. Nauk, 433, No. 2, 151-153 (2010).

    MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  10. J. Mead, “Recursive prime models for Boolean algebras,” Coll. Math., 41, 25-33 (1979).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    M. N. Gaskova

Authors
  1. M. N. Gaskova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. N. Gaskova.

Additional information

Translated from Algebra i Logika, Vol. 61, No. 4, pp. 443-460, July-August, 2022. Russian DOI: https://doi.org/10.33048/alglog.2022.61.404

(M. N. Gaskova) The study was carried out within the framework of the state assignment to Sobolev Institute of Mathematics SB RAS (project FWNF-2022-0011) and supported by RFBR (project No. 20-01-00300).

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gaskova, M.N. Boolean Algebras Autostable Relative to n-Decidable Presentations. Algebra Logic 61, 301–312 (2022). https://doi.org/10.1007/s10469-023-09698-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-023-09698-y

Keywords

Search

Navigation