We consider the class of “well-tempered” integer-valued scoring games, which have the property that the parity of the length of the game is independent of the line of play. We consider disjunctive sums of these games, and develop a theory for them analogous to the standard theory of disjunctive sums of normal-play partizan games. We show that the monoid of well-tempered scoring games modulo ind...

We introduce the growth partition function ZΓ,G(t) associated with any cancellative infinite monoid Γ with a finite generator system G. It is a power series in t whose coefficients lie in integral Lie-like space LZ(Γ, G) in the configuration algebra associated with the Cayley graph (Γ, G). We determine them for homogeneous monoids admitting left greatest common divisor and right common multiple...

Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element $qin Q$ can be written as $q=a^{-1}b$ for some $a,bin S$. If we insist on $a$ and $b$ being $er$-related in $Q$, then we say that $S$ is straight in $Q$. We characterize semigroups which are left I-quotients of left regular bands of right cancell...

The aim of this paper is to promote web geometry and, especially, the Reidemeister closure condition as a powerful and intuitive tool characterizing associativity of the Archimedean triangular norms. In order to demonstrate its possible applications, we provide the full solution to the problem of convex combinations of nilpotent triangular norms. Keywords— Archimedean triangular norm, web geome...

A concrete computation — twelve slidings with sixteen tiles — reveals that certain commutativity phenomena occur in every double semigroup. This can be seen as a sort of EckmannHilton argument, but it does not use units. The result implies in particular that all cancellative double semigroups and all inverse double semigroups are commutative. Stepping up one dimension, the result is used to pro...

Clifford and Preston (1961) showed several important characterizations of right groups. It was shown in Roy and So (1998) that, among topological semigroups, compact right simple or left cancellative semigroups are in fact right groups, and the closure of a right simple subsemigroup of a compact semigroup is always a right subgroup. In this paper, it is shown that such results can be generalize...

After dropping the implication-like operation and reversing the order, an MTL-algebra becomes a partially ordered structure (L;≤,⊕, 0, 1) based on the single addition-like operation ⊕. Furthermore, ⊕ may be restricted to a partial, but cancellative addition + without loss of information. We deal in this paper with the case that the resulting partial algebra (L;≤,+, 0, 1) is embeddable into the ...

In this paper we study zero-divisor graphs of semirings. We show that all zero-divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic zero-divisor graphs of semirings and prove that in the case zero-divisor graphs are cyclic, their girths are less than or equal to 4. We also give a description of the zero-diviso...

It is known that the monoidal t-norm based logic (MTL) and many of its schematic extensions are decidable. The usual way how to prove decidability of some schematic extension of MTL is to show that the corresponding class of algebras of truth values has the finite model property (FMP) or the finite embeddability property (FEP). However this method does not work for the extensions whose correspo...