Algebra universalis

, 61:441 | Cite as

The finite basis problem for endomorphism semirings of finite semilattices with zero



If \({\fancyscript{I}}\) is a join-semilattice with a distinguished least element, then all its endomorphisms form an additively idempotent semiring End(\({\fancyscript{I}}\)); conversely, it is known that any additively idempotent semiring embeds into an endomorphism semiring of such kind. If \({|\fancyscript{I}| \leq 2}\), then End(\({\fancyscript{I}}\)) is readily seen to be finitely based. On the other hand, if \({{\fancyscript{I}}}\) is finite and either contains the square of a two-element chain or is a chain with at least four elements, then End(\({\fancyscript{I}}\)) is shown to be inherently nonfinitely based. This leaves only the case when \({{\fancyscript{I}}}\) is a three-element chain as an open problem.

2000 Mathematics Subject Classification

Primary: 16Y60 Secondary:08B05 

Keywords and phrases

semiring endomorphism semiring of a semilattice finite basis problem INFB 


  1. 1.
    Birkhoff, G.: Lattice Theory. American Mathematical Society, Providence (1967)Google Scholar
  2. 2.
    Bloom S.L., Ésik Z.: Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1993)Google Scholar
  3. 3.
    Dolinka I.: A nonfinitely based finite semiring. Internat. J. Algebra Comput. 17, 1537–1551 (2007)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Dolinka I.: A class of inherently nonfinitely based semirings. Algebra Universalis 60, 19–35 (2009)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Golan, J.S.: The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science. Pitman Monographs and Surveys in Pure and Applied Mathematics. Longman Scientific & Technical, Harlow (1992)Google Scholar
  6. 6.
    Jackson M.: Finite semigroups whose varieties have uncountably many subvarieties. J. Algebra 228, 512–535 (2000)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Kruse R.L.: Identities satisfied by a finite ring. J. Algebra 26, 298–318 (1973)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kuich W., Salomaa A.: Semirings, Automata and Languages. EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1986)Google Scholar
  9. 9.
    Kuřil M., Polák L.: On varieties of semilattice-ordered semigroups. Semigroup Forum 71, 23–44 (2005)Google Scholar
  10. 10.
    L’vov, I.V.: Varieties of associative rings I. Algebra i Logika 12, 269–297 (1973); II. 667–688 (Russian)Google Scholar
  11. 11.
    McKenzie R.: Equational bases for lattice theories. Math. Scand. 27, 24–38 (1970)MATHMathSciNetGoogle Scholar
  12. 12.
    McKenzie R.: Tarski’s finite basis problem is undecidable. Internat. J. Algebra Comput. 6, 49–104 (1996)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    McNulty G.: A field guide to equational logic. J. Symbolic Comput. 14, 371–397 (1992)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Oates S., Powell M.B.: Identical relations in finite groups. J. Algebra 1, 11–39 (1964)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Perkins P.: Bases for equational theories of semigroups. J. Algebra 11, 298–314 (1968)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Sapir M.V.: Problems of Burnside type and the finite basis property in varieties of semigroups. Izv. Akad. Nauk SSSR, Ser. Mat. 51, 319–340 (1987) (Russian)MathSciNetGoogle Scholar
  17. 17.
    Vandiver H.S.: Note on a simple type of algebra in which the cancellation law of addition does not hold. Bull. Amer. Math. Soc. 40, 914–920 (1934)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Volkov M.V.: The finite basis problem for finite semigroups. Sci. Math. Jpn. 53, 171–199 (2001)MATHMathSciNetGoogle Scholar

Copyright information

© Birkhäuser Verlag Basel/Switzerland 2009

Authors and Affiliations

  1. 1.Department of Mathematics and InformaticsUniversity of Novi SadNovi SadSerbia

Personalised recommendations