Pith. sign in

REVIEW 6 minor 1 cited by

The finite basis problem for additively idempotent semirings that relate to S_7

T0 review · 0 major / 6 minor · reviewed 2026-08-09 · deepseek-v4-flash

Pith's one-line read The paper proves that the variety of the three-element semiring S7 contains exactly six finitely based subvarieties and continuum many subvarieties in total.

desk verdict Solid paper: the classification of finitely based subvarieties of V(S7) and the continuum result are real, and the Kneser-hypergraph connection is a genuinely nice tool; the only real soft spot is a terse reduction in Theorem 4.6, which looks patchable rather than fatal. read the letter →

arxiv 2501.19049 v1 pith:DFEL7SBW submitted 2025-01-31 math.GR math.CO

classification math.GRmath.CO MSC 16Y6003C0508B15
keywords additivelyidempotentsemiringfinitebasisproblemnonfinitelybasedvarietyhypergraphsubvarietylatticeKneserflatblock
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Additively idempotent semirings (ai-semirings) are structures with an idempotent addition and a distributive multiplication; the three-element semiring $S_7$ is the smallest possible nonfinitely based example, meaning that no finite set of equations can define the variety it generates. This paper draws the complete subvariety picture of the variety $\mathsf{V}(S_7)$ generated by $S_7$. It proves that exactly six subvarieties of $\mathsf{V}(S_7)$ are finitely based — the trivial variety, $\mathsf{V}(M_2)$, $\mathsf{V}(\mathrm{Sc}(a))$, $\mathsf{V}(\mathrm{Sc}(ab))$, $\mathsf{V}(M_2,\mathrm{Sc}(a))$ and $\mathsf{V}(M_2,\mathrm{Sc}(ab))$ — and that every subvariety containing $\mathrm{Sc}(abc)$ is nonfinitely based. It then shows that $\mathsf{V}(S_7)$ contains $2^{\aleph_0}$ subvarieties, confirming the conjecture that $S_7$ is of type $2^{\aleph_0}$. The payoff is a complete answer to the finite-basis problem for every ai-semiring living inside $\mathsf{V}(S_7)$, with the boundary between finite and nonfinite axiomatisability located exactly.

What carries the argument

The argument runs on three devices. (1) The equational criterion for $S_7$ (Lemma 1.2): an identity $u \approx v$ holds in $S_7$ exactly when the two terms use the same variables, $c(u)=c(v)$, and the invariant $\delta(u)$ equals $\delta(v)$, where $\delta(u)$ collects the nonempty subsets of variables that meet every word of $u$ in exactly one variable occurring once. This turns the equational theory of $S_7$ into finite combinatorics. (2) A sufficient condition for nonfinite basis (Theorem 2.2): fix 3-uniform hypergraphs $H_n$ that are not 2-colourable and have girth greater than $3\binom{3n}{2}$, form the term $t_{H_n}$ by summing all hyperedge products, and let $w_n$ be a non-hyperedge term; any variety containing $\mathrm{Sc}(abc)$ and satisfying $t_{H_n} \approx t_{H_n} + w_n$ for all $n$ is nonfinitely based, because the hypergraph semiring $S_{H_n}$ fails each identity while every $n$-generated subalgebra of $S_{H_n}$ lies inside the variety. (3) The block-hypergraph classification (Theorem 4.6): the finite subdirectly irreducible members of $\mathsf{V}(S_7)$ are exactly $M_2$, algebras containing a copy of $S_7$, and flat semirings $S_H$ where $H$ is a block hypergraph — a hypergraph whose vertices are the members of a partition system $F$ on a finite set and whose hyperedges are the partitions of that set by members of $F$. This recasts subvariety questions as hypergraph homomorphism questions, and the continuum is obtained from the homomorphism-independent family of Kneser hypergraphs $\{\mathrm{KG}_r(rp,p) : p \text{ prime}\}$.

What would settle it

Enumerate the finite subdirectly irreducible flat semirings of order at most six that satisfy the identities of $S_7$ ($x^3 \approx x^2$, $xy \approx yx$, $x+xy \approx xy^2$, $x+y^2 \approx x^2y^2$) and test each against the three cases of Theorem 4.6: isomorphic to $M_2$, containing a copy of $S_7$, or isomorphic to a block-hypergraph semiring $S_H$. The classification predicts that none falls outside these cases, so a single exception would refute the 'exactly six' and continuum conclusions; such an enumeration also probes the unproved 'no loss of generality in assuming $I=J$' step, since any algebra missed by that reduction would appear in the list.

Watch

Extended reading notes

Core claim

The paper's central result, Theorem 3.18, is that $\mathsf{V}(S_7)$ has exactly six finitely based subvarieties: the trivial variety, $\mathsf{V}(M_2)$, $\mathsf{V}(\mathrm{Sc}(a))$, $\mathsf{V}(\mathrm{Sc}(ab))$, $\mathsf{V}(M_2,\mathrm{Sc}(a))$ and $\mathsf{V}(M_2,\mathrm{Sc}(ab))$, all sitting at the base of the subvariety lattice. A companion statement (Corollary 3.19) makes the boundary sharp: a subvariety of $\mathsf{V}(S_7)$ is finitely based if and only if it does not contain $\mathrm{Sc}(abc)$, so $\mathsf{V}(\mathrm{Sc}(abc))$ is the unique minimal nonfinitely based subvariety. Section 4 then gives a structural description of the finite subdirectly irreducible members (the indecomposable building blocks) of $\mathsf{V}(S_7)$: up to isomorphism they are $M_2$, algebras containing a copy of $S_7$, or flat semirings $S_H$ built from a block hypergraph $H$. Combining this with homomorphism results for Kneser hypergraphs shows that the interval $[\mathsf{V}(\mathrm{Sc}(a_1\cdots a_k)), N_{k+1}]$ has cardinality $2^{\aleph_0}$ for every $k>2$, and hence that $\mathsf{V}(S_7)$ contains a continuum of subvarieties — confirming the conjecture, proposed in the earlier literature, that $M(a)$ (which is isomorphic to $S_7$) generates a semiring variety with continuum many subvarieties.

Load-bearing premise

The classification rests on two theorems about flat extensions of partial algebras that the paper cites but does not restate, together with an asserted reduction in the proof of Theorem 4.6: 'there is no loss of generality in assuming $I=J$', and the element $1$ can be deleted from $B_p$. If that reduction silently omits some subdirectly irreducible algebra that is not a block-hypergraph semiring, both the continuum conclusion and the 'exactly six' classification would collapse.

Editorial extensions

If this is right

  • A subvariety of $\mathsf{V}(S_7)$ is finitely based if and only if it avoids $\mathrm{Sc}(abc)$; the six finitely based varieties at the bottom of the lattice are the complete finite-basis picture (Corollary 3.19, Theorem 3.18).
  • For every $k>2$ the interval $[\mathsf{V}(\mathrm{Sc}(a_1\cdots a_k)), N_{k+1}]$ contains a chain and an antichain of size $2^{\aleph_0}$, so the subvariety lattice of $\mathsf{V}(S_7)$ has both height and width $2^{\aleph_0}$ (Corollary 4.13).
  • The subvariety $N$ determined by $x^2y \approx x^2$ is not finitely generated; it is the join of the varieties $\mathsf{V}(\mathrm{Sc}(a_1\cdots a_k))$ for $k\ge 1$, and $N_k$ is finitely generated exactly for $k\le 3$ (Corollary 3.12, Lemma 4.7, Corollary 4.16).
  • Every variety in the interval $[\mathsf{V}(\mathrm{Sc}(abc)), \mathsf{V}(S^0_7)]$ is nonfinitely based, and all seven four-element ai-semirings $S_{(4,k)}$ for $k = 84, 94, 117, 123, 173, 282, 359$ are nonfinitely based (Corollaries 2.5, 2.7–2.9).
  • $\mathsf{V}(\mathrm{Sc}(abc))$ is the unique minimal nonfinitely based subvariety of $\mathsf{V}(S_7)$, refining the earlier result that it is merely a minimal one (Corollary 3.20).

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The block-hypergraph representation converts a piece of universal algebra into graph theory: since the paper notes that deciding whether a hypergraph is a block hypergraph is NP-hard, identifying which of the three cases in Theorem 4.6 a given algebra falls into is in general computationally intractable — a practical limit on reading the classification off a Cayley table.
  • The same construction — a homomorphism-independent family of Kneser hypergraphs with fixed ratio of the two parameters — should transplant to any variety whose finite subdirectly irreducible members are flat hypergraph semirings of bounded uniformity, potentially yielding further continuum-type examples among ai-semirings.
  • The still-open question of whether every finite ai-semiring whose variety contains $S_7$ is nonfinitely based now has a concrete test: by Theorem 2.2, any such variety containing $\mathrm{Sc}(abc)$ is nonfinitely based as soon as it validates the identities $t_{H_n} \approx t_{H_n} + w_n$ for every $n$, so the identities are checkable case by case for each new candidate semiring.
  • Inside $\mathsf{V}(S_7)$, whether a subvariety is finitely based is decided by a single subalgebra: $\mathrm{Sc}(abc)$ separates the six finitely based subvarieties from the continuum of nonfinitely based ones, so the entire lattice is organised around one obstruction.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 6 minor

Summary. The paper studies the finite basis problem for additively idempotent semirings related to the 3-element nonfinitely based semiring S7. It first proves a sufficient condition, using 3-uniform hypergraphs of large girth, for an ai-semiring variety to be nonfinitely based, and applies it to several 4-element ai-semirings and to the interval above V(Sc(abc)). It then analyzes the subvariety lattice of V(S7), showing that exactly six subvarieties are finitely based (the trivial variety and five others), and that all other subvarieties are nonfinitely based. Finally, using partition systems and Kneser hypergraphs, it shows that V(S7) contains a continuum of subvarieties, establishing that S7 has type 2^aleph0 and resolving a conjecture from Ren et al. [29].

Significance. If correct, the paper gives the first finite algebra of this signature known to have type 2^aleph0 and completely answers the finite basis problem for V(S7). The main results are mathematically substantial: they combine universal algebraic techniques (flat extensions, divisor restrictions, Willard–Jackson theorems) with combinatorial tools (Kneser graphs/hypergraphs, Lovász's theorem). The paper also provides a clean, reusable sufficient condition for nonfinite basis. The proofs are mostly coherent, and the central derivation is sound; the main gaps are local and can be repaired. The reliance on external theorems is normal, and no circularity was found.

minor comments (6)
  1. [Section 2, Corollary 2.9] The inference from 'both S(4,123) and S(4,359) are isomorphic to subdirect products of S7 and S53' to 'V(S(4,359)) = V(S(4,123))' is not valid in general, because different subdirect products of the same pair of algebras need not generate the same variety; please supply an explicit isomorphism or a direct argument for the equality.
  2. [Section 4, Theorem 4.6] The proof of Theorem 4.6 is too compressed: the reduction to I = J and the assertion that the element 1 can be removed are stated without proof, and the verification that F = {I_b | b in P} forms a partition system (conditions (Ha) and (Hb)) and that flat extension of B_p is isomorphic to the block hypergraph semiring is only sketched; in addition, the notation S1_H used in case (2) is never defined, and the derivation of that case is not given.
  3. [Section 4, Corollary 4.13] The sentence 'the semiring S_{F_{p,r}} is (r+1)-nilpotent, so sits within the interval [V(Sc(a1...ar)), N_{r+1}]' omits the lower-bound containment: (r+1)-nilpotency only gives membership in N_{r+1}, and the fact that V(Sc(a1...ar)) embeds into S_{F_{p,r}} (for instance, via the r blocks B_i = {(i-1)p+1, ..., ip}) should be stated explicitly.
  4. [Section 2, Theorem 2.2] The proof relies on 'from the proof of [19, Theorem 4.9]' to assert that every n-generated subalgebra of S_{H_n} lies in V(Sc(abc)); please state this fact explicitly or give a direct reference, as it is a key step in the nonfinite-basis argument.
  5. [Section 4, Lemma 4.10] The proof states that the evaluation of t_G lies in {J, infinity}; this step would be clearer if the authors noted that, because the block hypergraph is k-uniform, any defined product of k vertices of the block hypergraph must be the full ground set J (a hyperedge is a partition of J into k blocks).
  6. [Throughout] There are several typos and notational slips: the abstract contains 'nonnitely' (should be 'nonfinitely'), Corollary 3.14 has an unmatched parenthesis in 'V(Sc(ab)', and reference [9] contains a garbled string 'G/suppress lazek' (apparently 'Glazek'); a proofreading pass is recommended.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the classification and continuum results are derived from independent prior theorems and are not equivalent to their inputs.

full rationale

The paper's derivation chain is not circular in any of the seven enumerated senses. Theorem 2.2 uses the standard argument that if every n-generated subalgebra of a hypergraph semiring lies in V while the whole semiring does not, then V has no finite basis; the cited fact from [19, Theorem 4.9] is a prior published subalgebra result, not the paper's target conclusion, and the identities (4) are verified directly for S0_7 via Lemma 1.3 from [34]. The six-variety classification in Theorem 3.18 is assembled from Propositions 3.5, 3.13 and 3.15; the citations to [29] and [30] concern independent structural facts about minimal ai-semiring varieties and varieties of Sc(w) semirings, and Proposition 3.17 gives a direct finite basis for V(M2,Sc(ab)). The continuum result in Corollary 4.13 rests on the external Kneser hypergraph homomorphism results of [3] and [12] (Lemma 4.11) and on Lemma 4.10, which is proved in the paper; the embedding of the powerset of the primes is a genuine construction, not a renaming of a known conclusion. Theorem 4.6 invokes the flat-extension theorems of Willard [33] and Jackson [16] as external tools, then reduces the divisor-restricted subalgebra B_p to a partition system F; this reduction is a proof step whose hypotheses are not baked into the statement. The terse 'no loss of generality in assuming I=J' and the deletion of the element 1 are compressed and could be a correctness-exposition gap, but they are not circular: no equation is used as both premise and conclusion, no fitted parameter is relabelled as a prediction, and the self-citations, while present, are to prior published results that do not assume the present theorems.

Assumptions & free parameters 0 free parameters · 8 assumptions · 2 invented entities

The paper's central claims rest on standard universal algebra, published results by the same group about S7 and S0_7, and external theorems about Kneser graphs and flat extensions. No parameters are fitted to data. The only invented objects are mathematical constructions, partition systems and block hypergraphs, which are well-defined and used to prove the structural theorems.

assumptions (8)
  • standard math Birkhoff's variety theorem and standard universal algebra facts about subdirectly irreducible algebras
    Used throughout: equational classes equal varieties, and subdirect decomposition is invoked.
  • standard math Erdos-Hajnal theorem: existence of arbitrarily large girth non-2-colourable 3-uniform hypergraphs
    Invoked in Section 2 to build hypergraphs H_n for Theorem 2.2; cited to [8] and [19].
  • domain assumption Jackson-Ren-Zhao [19, Theorem 4.9]: n-generated subalgebras of hypergraph semirings S_H lie in V(Sc(abc)) under girth conditions
    Load-bearing for Theorem 2.2; the girth requirements are not restated in this paper.
  • domain assumption Wu-Ren-Zhao [34, Lemma 1.3]: equational description of identities satisfied by S0_7 of the form u ≈ u+q
    Used in Corollary 2.5 to place the interval [V(Sc(abc)), V(S0_7)] under Theorem 2.2.
  • domain assumption Willard [33, Theorem 1.2] and Jackson [16, Theorem 3.3]: classification of subdirectly irreducible algebras in varieties generated by flat extensions
    Basis for Theorem 4.6 and Lemma 4.8; conditions are cited, not verified in the text.
  • standard math Lovasz's theorem on chromatic number of Kneser graphs KG2(n,k) = n - 2k + 2
    Used in Lemma 4.14 and Proposition 4.15 to bound strong colourings of block hypergraphs.
  • standard math Bonomo-Braberman et al. [3, Theorem 1] and Godsil-Royle [12, Lemma 7.9.3] on Kneser hypergraph and graph homomorphisms
    Used to build the homomorphism-independent family in Corollary 4.12, which underlies Corollary 4.13.
  • domain assumption Ren-Jackson-Zhao-Lei [29] and Shao-Ren [30] results on varieties V(Sc(a1...ak)), N2, N3, and minimal subvarieties
    Used in Section 3 to identify the six finitely based subvarieties and to establish the lower part of the subvariety lattice.
invented entities (2)
  • partition system and block hypergraph H_F
    purpose: Combinatorial object encoding subdirectly irreducible members of V(S7) and enabling the continuum construction
    Mathematical construction introduced in Section 4; it is well-defined and proved to capture subdirectly irreducible algebras, not an unexplained postulate.
  • block hypergraph semiring S_{H_F}
    purpose: Flat semiring associated to a block hypergraph; used to separate subvarieties via identities t_H ≈ t^2_H
    Defined construction with explicit multiplication rule; its role in the proofs is demonstrated in Lemma 4.2 and Lemma 4.10.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The finite basis problem for additively idempotent semirings that relate to S_7." pith.science (2026). https://pith.science/paper/DFEL7SBW

@misc{pith2026250119049,
  author       = {Pith},
  title        = {Pith review of: The finite basis problem for additively idempotent semirings that relate to S_7},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DFEL7SBW}},
  note         = {Machine review of arXiv:2501.19049}
}
abstract

The $3$-element additively idempotent semiring $S_7$ is a nonnitely based algebra of the smallest possible order. In this paper we study the nite basis problem for some additively idempotent semirings that relate to $S_7$. We present a su cient condition under which an additively idempotent semiring variety is nonnitely based and as applications, show that some additively idempotent semiring varieties that contain $S_7$ are also nonnitely based. We then consider the subdirectly irreducible members of the variety $\mathsf{V}(S_7)$ generated by $S_7$. We show that $\mathsf{V}(S_7)$ contains exactly $6$ finitely based subvarieties, all of which sit at the base of the subvariety lattice, then invoke results from the homomorphism theory of Kneser graphs to verify that $\mathsf{V}(S_7)$ contains a continuum of subvarieties.

Figures

Figures reproduced from arXiv: 2501.19049 by the authors.

Figure 1
Figure 1. The subvariety lattice of V(S7). The reader may find it useful to consult [PITH_FULL_IMAGE:figures/full_fig_p013_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The finite basis problem for matrix semirings $\mathbf{M}_n(S_7)$

    math.RA 2026-06 accept novelty 6.5 of 10

    Every variety between Sc(abc) and Mn(S7) is nonfinitely based, so Mn(S7) itself is nonfinitely based for all n≥2 and the interval from V(S7) is infinite.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages · cited by 1 Pith paper

  1. [29]

    M.M. Ren, M. Jackson, X.Z. Zhao, D.L. Lei, Flat extension s of groups and limit varieties of additively idempotent semirings, J. Algebra 623 (2023), 64–85

  2. [1]

    Alsulami, M

    T. Alsulami, M. Jackson, Finite models for positive combi natorial and exponential algebra, manuscript (2024), https://arxiv.org/abs/2411.05101

  3. [2]

    N. Alon, P. Frankl, L. Lov´ asz, The chromatic number of Kneser hypergraphs, Trans. Amer. Math. Soc. 298 (1986), 359–370

  4. [3]

    Bonomo-Braberman, M.C

    F. Bonomo-Braberman, M.C. Dourado, M. Valencia-Pabon, J .C. Vera, A note on homomor- phisms of Kneser hypergraphs, Appl. Math. Comput. 366 (2020), 124764, 5 pp

  5. [4]

    Burris, H.P

    S. Burris, H.P. Sankappanavar, A Course in Universal Alge bra, Springer-Verlag, New York, 1981

  6. [5]

    Connes, C

    A. Connes, C. Consani, On absolute algebraic geometry the affine case, Adv. Math. 390 (2021), 107909

  7. [6]

    Dolinka, A nonfintely based finite semiring, Internat

    I. Dolinka, A nonfintely based finite semiring, Internat. J. Algebra Comput. 17 (2007), no. 8, 1537–1551

  8. [7]

    Dolinka, S

    I. Dolinka, S. Gusev, M.V. Volkov, Semiring and involutio n identities of powers of inverse semigroups, Comm. Algebra 52 (2024), no. 5, 1922–1929

Show all 36 references
  1. [8]

    Erd˝ os, A

    P. Erd˝ os, A. Hajnal, On chromatic number of graphs and set -systems, Acta Mathematica Academiae Scientiarum Hungaricae Tomus 17 (1966), 61–99

  2. [9]

    G/suppress lazek, A Guide to the Literature on Semirings and their Applications in Mathematics and Information Science, Kluwer Academic Publishers, Dord recht-Boston-London, 2001

    K. G/suppress lazek, A Guide to the Literature on Semirings and their Applications in Mathematics and Information Science, Kluwer Academic Publishers, Dord recht-Boston-London, 2001

  3. [10]

    Ghosh, F

    S. Ghosh, F. Pastijn, X.Z. Zhao, Varieties Generated by O rdered Bands I, Order 22 (2005), no. 2, 109–128

  4. [11]

    Glasson, The Rees quotient monoid generates a variety with uncountably many subvari- eties, Semigroup Forum 109 (2024), 476–481

    D. Glasson, The Rees quotient monoid generates a variety with uncountably many subvari- eties, Semigroup Forum 109 (2024), 476–481

  5. [12]

    Godsil, G

    C. Godsil, G. Royle, Algebraic Graph Theory, Graduate Te xts in Mathematics 207, Springer, 2001

  6. [13]

    Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Com- puter Science, Longman Scientific and Technical, Harlow, 19 92

    J.S. Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Com- puter Science, Longman Scientific and Technical, Harlow, 19 92

  7. [14]

    Gusev, Small monoids generating varieties with uncou ntably many subvarieties, Semigroup Forum (2024), https://doi.org/10.1007/s00233-024-10499-7

    S. Gusev, Small monoids generating varieties with uncou ntably many subvarieties, Semigroup Forum (2024), https://doi.org/10.1007/s00233-024-10499-7

  8. [15]

    L. Ham, M. Jackson, Axiomatisability and hardness for universal Horn classes of hypergraphs, Algebra Univers. 79 (2018), 30

  9. [16]

    Jackson, Flat algebras and the translation of univers al Horn logic to equational logic, J

    M. Jackson, Flat algebras and the translation of univers al Horn logic to equational logic, J. Symb. Logic 73 (2008), 90–128

  10. [17]

    Jackson, Flexible constraint satisfiability and a pro blem in semigroup theory, manuscript (2015), https://arxiv.org/abs/1512.03127

    M. Jackson, Flexible constraint satisfiability and a pro blem in semigroup theory, manuscript (2015), https://arxiv.org/abs/1512.03127

  11. [18]

    Jackson, E.W.H

    M. Jackson, E.W.H. Lee, Monoid varieties with extreme pr operties, Trans. Am. Math. Soc. 370 (2018), 4785–4812

  12. [19]

    Jackson, M.M

    M. Jackson, M.M. Ren, X.Z. Zhao, Nonfinitely based ai-sem irings with finitely based semi- group reducts, J. Algebra 611 (2022), 211–245

  13. [20]

    Jeˇ zek, Nonfinitely based three-element idempotent groupoids, Algebra Univers

    J. Jeˇ zek, Nonfinitely based three-element idempotent groupoids, Algebra Univers. 20 (1985), 292–301. 22 ZIDONG GAO, MARCEL JACKSON, MIAOMIAO REN, AND XIANZHONG Z HAO

  14. [21]

    Lov´ asz, Kneser’s conjecture, chromatic number and h omotopy, J

    L. Lov´ asz, Kneser’s conjecture, chromatic number and h omotopy, J. Comb. Theory Ser. A 25 (1978) 319–324

  15. [22]

    Lyndon, Identities in two-valued calculi, Trans

    R.C. Lyndon, Identities in two-valued calculi, Trans. Amer. Math. Soc. 71 (1951), no. 3, 457–465

  16. [23]

    Lyndon, Identities in finite algebras, Proc

    R.C. Lyndon, Identities in finite algebras, Proc. Amer. Math. Soc. 5 (1954), 8–9

  17. [24]

    Maclagan, B

    D. Maclagan, B. Sturmfels, Introduction to Tropical Geo metry, Grad. Stud. Math., vol. 161. American Mathematical Society, Providence, RI, 2015

  18. [25]

    Murskiˇ ı, The existence in the three-valued logic of a closed class with a finite basis having no finite complete system of identities, Soviet Math

    V.L. Murskiˇ ı, The existence in the three-valued logic of a closed class with a finite basis having no finite complete system of identities, Soviet Math. Dokl. 6 (1965), 1020–1024

  19. [26]

    Pastijn, Varieties generated by ordered bands II, Order 22 (2005), no

    F. Pastijn, Varieties generated by ordered bands II, Order 22 (2005), no. 2, 129–143

  20. [27]

    Polin, Minimal varieties of semirings, Math

    S.V. Polin, Minimal varieties of semirings, Math. Notes 27 (1980), no. 4, 259–264

  21. [28]

    Ren, J.Y

    M.M. Ren, J.Y. Liu, L.L. Zeng, M.L. Chen, The finite basis problem for additively idempotent semirings of order four, I, manuscript (2024), https://arxiv.org/abs/2407.15342

  22. [30]

    Shao, M.M

    Y. Shao, M.M. Ren, On the varieties generated by ai-semirings of order two, Semigroup Forum 91 (2015), no. 1, 171–184

  23. [31]

    Alg. Systems and their varieties

    A.N. Trahtman, Six-element semigroup generates a varie ty with uncountably many subvari- eties, in “Alg. Systems and their varieties”, Sverdlovsk (1 988), 138–143 (in Russian)

  24. [32]

    Volkov, Semiring identities of the Brandt monoid, A lgebra Universalis 82 (2021), no

    M.V. Volkov, Semiring identities of the Brandt monoid, A lgebra Universalis 82 (2021), no. 3, 42

  25. [33]

    Willard, On McKenzie’s method, Period

    R. Willard, On McKenzie’s method, Period. Math. Hungar. 32 (1996), 149–165

  26. [34]

    Y.N. Wu, M.M. Ren, X.Z. Zhao, The additively idempotent s emiring S0 7 is nonfinitely based, Semigroup Forum 108 (2024), no. 2, 479–487

  27. [35]

    Yue, M.M

    M.Y. Yue, M.M. Ren, L.L. Zeng, Y. Shao, The finite basis pro blem for additively idempotent semirings of order four, II, manuscript (2025), https://arxiv.org/abs/2501.03263

  28. [36]

    Zhao, M.M

    X.Z. Zhao, M.M. Ren, S. Crvenkovi´ c, Y. Shao, P. ¯Dapi´ c, The variety generated by an ai- semiring of order three, Ural Math. J. 6 (2020), no. 2, 117–132. School of Mathematics, Northwest University, Xi’an, 710127, S haanxi, P.R. China Email address : zidonggao@yeah.net Depa...

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.