the concept of algebraic hyperstructures introduced by marty as a generalization of ordinary algebraic structures. in an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. the concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyper rings and a generalizat...

The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyper‌rings and a generalizat...

In this paper we propose a semiring-theoretic approach to MV-algebras based on the connection between such algebras and idempotent semirings established in [11] and improved in [4] — such an approach naturally imposing the introduction and study of a suitable corresponding class of semimodules, called MV-semimodules. Besides some basic yet fundamental results of more general interest for semiri...

We consider the iterates of bilinear functions over the semiring (max,+). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (max,+). In this semiring, a fundamental result associates the asymptotic behaviour of the iterates of a linear function with the maximal average weight of the circuits in a graph naturally associated with the function. Here we p...

This paper introduces the foundations of the polynomial algebra and basic structures for algebraic geometry over the extended tropical semiring. Our development, which includes the tropical version for the fundamental theorem of algebra, leads to the reduced polynomial semiring – a structure that provides a basis for developing a tropical analogue to the classical theory of commutative algebra....

Deciding the equivalence of SQL queries is a fundamental problem in data management. As prior work has mainly focused on studying the theoretical limitations of the problem, very few implementations for checking such equivalences exist. In this paper, we present a new formalism and implementation for reasoning about the equivalences of SQL queries. Our formalism, U-semiring, extends SQL’s semir...

1. Introduction. When studying ideal theory in semirings, it is natural to consider the quotient structure of a semiring modulo an ideal. If 7 is an ideal in a semiring R, the collection {x+l}xeit oí sets x + I={x+i\iEl} need not be a partition of R. Faced with this problem, [2] used equivalence relations to determine cosets relative to an ideal. La Torre successfully established analogues of s...

When the first operation’s inverse axiom is deleted from ring, an algebraic structure, semiring, generated. Subsemiring one of subjects covered in semiring. The concepts fuzzy subsemiring, anti subsemiring and complement are introduced this paper. In addition, anti-subsemiring a wedge, or combination two more associated with non-empty subset semiring whose membership criteria defined by value z...

We formalize that the image of a semiring of sets [17] by an injective function is a semiring of sets. We offer a non-trivial example of a semiring of sets in a topological space [21]. Finally, we show that the finite product of a semiring of sets is also a semiring of sets [21] and that the finite product of a classical semiring of sets [8] is a classical semiring of sets. In this case, we use...