Skip to main content
Log in

Axiomatizability and model completeness of the class of regular polygons

  • 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

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

Instant access to the full article PDF.

References

  1. M. Kilp and U. Knauer, “Characterization of monoids by properties of regular acts,” J. Pure Appl. Algebra,46, No. 2/3, 217–231 (1987).

    Google Scholar 

  2. V. Gould, “Axiomatisability problems forS-systems,” J. London Math. Soc. (2),35, No. 2, 193–201 (1987).

    Google Scholar 

  3. V. Gould, Model companions ofS-systems,” Quart. J. Math. Oxford Ser. (2),38, No. 150, 189–211 (1987).

    Google Scholar 

  4. E. M. Kremer and A. A. Stepanova, “Monoids with axiomatizable class of strongly plane polygons,” in: Abstracts: 10 All-Union Conference on Mathematical Logic [in Russian], Alma-Ata, 1990.

  5. Yu. L. Ershov and E. A. Palyutin, Mathematical Logic [in Russian], Nauka, Moscow (1987).

    Google Scholar 

  6. G. E. Sacks, Saturated Model Theory [Russian translation], Mir, Moscow (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated fromSibirskii Matematicheskii Zhurnal, Vol. 35, No. 1, pp. 181–193, January–February, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stepanova, A.A. Axiomatizability and model completeness of the class of regular polygons. Sib Math J 35, 166–177 (1994). https://doi.org/10.1007/BF02104958

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation