paper

The strong nonfinite basis property of

arXiv:2610.13980

Abstract

We prove that the three-element additively idempotent semiring is strongly nonfinitely based: every finite additively idempotent semiring whose generated variety contains has no finite equational basis. This answers Problem~1.2 in Yue, Ren and Gao's paper Explicit equational bases for the power semirings of affirmatively. The proof combines a rigidity property of set systems with private points and a probabilistic construction derived from semilinear sets of letter counts in finite semigroups. The argument allows arbitrary polynomial substitutions and does not assume commutative multiplication. As consequences, both power semirings of the multiplicative reduct of , and both power semirings of every finite group of order at least three, are strongly nonfinitely based. All algebras are considered in the signature without nullary operations.