If you were looking for a field with convenient terminology for its structures, I should warn you that the field of semirings is pretty bad :)
In
"Graphs, dioids and semirings: new models and algorithms" by Michel Gondran, Michel Minoux
they use "presemiring" to mean a set with two associative binary opearations, + and X where + is commutative and X distributes over + on both sides.
To make a presemiring a semiring, they require identity elements for both operations, and require that the additive identity 0 is absorbing, as you describe.
I wouldn't put too much stock in the one book though. Really there are so many authors throwing around so many terms about these things it's probably useless to find out which is the most common.
No comments:
Post a Comment