Abstract
It is proved that for a linearly ordered monoid of depth 2, with an axiomatizable class of regular polygons, the completeness of this class is equivalent to its model completeness, and we give an algebraic description of such monoids.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
REFERENCES
E. V. Ovchinnikova, “Complete classes of regular polygons with finitely many idempotents,” Sib. Mat. Zh., 36, No. 2, 381-384 (1995).
E. V. Ovchinnikova, “A monoid the class of regular polygons over which is complete but not model complete,” Sib. Mat. Zh., 38, No. 5, 1110-1114 (1997).
E. V. Ovchinnikova, “A non-linearly ordered monoid the class of regular polygons over which is complete but not model complete,” in Algebra and Model Theory 3 [in Russian], NGTU, Novosibirsk (2001), pp. 83-98.
A. A. Stepanova, “Axiomatizability and model completeness of the class of regular polygons,” Sib. Mat. Zh., 35, No. 1, 181-193 (1994).
Tran Lam Hach, “Characterization of monoid by regular acts,” Per. Math. Hung., 16, 273-279 (1985).
T. G. Mustafin, “Stability in the theory of polygons,” in Model Theory and Its Applications, Trudy Inst. Mat. SO AN SSSR, Vol. 8, Nauka, Novosibirsk (1988), pp. 92-108.
A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, AMS, Providence (1967).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ovchinnikova, E.V. Complete Classes of Regular Polygons over Monoids of Depth 2. Algebra and Logic 41, 409–413 (2002). https://doi.org/10.1023/A:1021759714514
Issue Date:
DOI: https://doi.org/10.1023/A:1021759714514