Skip to main content
SpringerLink
Log in

Undecidability of the theory of Boolean algebras with automorphism

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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

Literature Cited

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

    Google Scholar 

  2. Yu. L. Ershov, “Undecidability of certain fields,” Dokl. Akad. Nauk SSSR,161, No. 1, 27–29 (1965).

    Google Scholar 

  3. P. S. Novikov, “Algorithmic undecidability of the word identity problem in group theory,” Tr. Mat. Inst. Akad. Nauk SSSR,14, 709–711 (1955).

    Google Scholar 

Download references

Authors
  1. V. I. Mart'yanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A. A. Zhdanov Irkutsk State University, Irkutsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 23, No. 3, pp. 147–154, May–June, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mart'yanov, V.I. Undecidability of the theory of Boolean algebras with automorphism. Sib Math J 23, 408–415 (1982). https://doi.org/10.1007/BF00973498

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00973498

Search

Navigation