Computer finding of four-element multiplicatively idempotent semirings

Бесплатный доступ

In this paper we describe a computer program for searching for all four-element multiplicatively idempotent semirings. We have established that up to the isomorphism of such semirings exactly 381, they are represented by Cayley tables of additive and multiplicative reducts. We give the necessary definitions, properties and illustrations.

Finite semiringi, dempotence, multiplicatively idempotent semiring, computer modeling

Короткий адрес: https://sciup.org/147245530

IDR: 147245530   |   DOI: 10.17072/1993-0550-2022-2-46-52

Статья научная