Skip to main content
Log in

Acts over semilattices

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

In this paper, we consider acts over commutative semigroups of idempotents (semilattices). We prove that an act over a semilattice is a partially ordered set. We obtain a full description of acts over a finite chain and a necessary condition for a partially ordered set to be an act over some semilattice.

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.

Similar content being viewed by others

References

  1. A. Yu. Avdeyev and I. B. Kozhukhov, “Acts over completely 0-simple semigroups,” Acta Cybernet., 14, No. 4, 523–531 (2000).

    MATH  MathSciNet  Google Scholar 

  2. M. Kilp, U. Knauer, and A. V. Mikhalev, Monoids, Acts and Categories, Walter de Gruyter, Berlin (2000).

    MATH  Google Scholar 

  3. I. B. Kozhukhov and M. Yu. Maksimovskiy, “On automata over semilattices,” in: V. A. Barkhotkin, ed., System Analyses and Information Control Systems [in Russian], MIET, Moscow (2006), pp. 19–34.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Yu. Maksimovskiy.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 14, No. 7, pp. 151–156, 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maksimovskiy, M.Y. Acts over semilattices. J Math Sci 164, 255–259 (2010). https://doi.org/10.1007/s10958-009-9726-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-009-9726-2

Keywords

Navigation