Skip to main content
SpringerLink
Log in

Axiomatizability and completeness of some classes of partially ordered polygons

  • Published:
Algebra and Logic Aims and scope

We study partially ordered monoids over which a class of free (over sets and over posets), projective, and (strongly, weakly) flat partially ordered polygons is axiomatizable, complete, or model complete. Similar issues for polygons were dealt with in papers by V. Gould and A. Stepanova.

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. A. A. Stepanova, “Axiomatizability and completeness of a class of S-polygons,” Algebra Logika, 30, No. 5, 583–594 (1991).

    MathSciNet  Google Scholar 

  2. V. Gould, “Axiomatisability problems for S-systems,” J. London Math. Soc., II. Ser., 35, 193–201 (1987).

    Article  Google Scholar 

  3. S. Bulman-Fleming and V. Gould, “Axiomatisability of weakly flat, flat and projective S-acts,” Comm. Alg., 30, No. 11, 5575–5593 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  4. X. Shi, “Strongly flat and po-flat S-posets,” Comm. Alg., 33, No. 12, 4515–4531 (2005).

    Article  MATH  Google Scholar 

  5. J. B. Fountain, “Perfect semigroups,” Proc. Edinburgh Math. Soc., II. Ser., 20, 87–93 (1976).

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  7. P. Gabriel and M. Zisman, Calculus of Fractions and Homotopy Theory, Springer-Verlag, New York (1967).

    MATH  Google Scholar 

  8. X. Shi, Z. Liu, F. Wang, and S. Bulman-Fleming, “Indecomposable, projective and flat S-posets,” Comm. Alg., 33, No. 1, 235–251 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Kilp, U. Knauer, and A. V. Mikhalev, Monoids, Acts and Categories. With Applications to Wreath Products and Graphs. A Handbook for Students and Researchers, Walter de Gruyter, Berlin (2000).

    MATH  Google Scholar 

  10. J. R. Isbell, “Perfect monoids,” Semigroup Forum, 2, 95–118 (1971).

    Article  MATH  MathSciNet  Google Scholar 

  11. S. Bulman-Fleming and V. Laan, “Lazard’s theorem for S-posets,” Math. Nachr., 278, No. 15, 1743–1755 (2005).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Far Eastern National University, ul. Sukhanova 8, Vladivostok, 690600, Russia

    M. A. Pervukhin

  2. Far Eastern National University, ul. Sukhanova 8, Vladivostok, 690600, Russia

    A. A. Stepanova

Authors
  1. M. A. Pervukhin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Stepanova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. A. Pervukhin.

Additional information

Supported by the Council for Grants (under RF President) and State Aid of Leading Scientific Schools (grant NSh-2810.2008.1).

Translated from Algebra i Logika, Vol. 48, No. 1, pp. 90–121, January–February, 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pervukhin, M.A., Stepanova, A.A. Axiomatizability and completeness of some classes of partially ordered polygons. Algebra Logic 48, 54–71 (2009). https://doi.org/10.1007/s10469-009-9040-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-009-9040-6

Keywords

Search

Navigation