pith. sign in

arxiv: 1809.07646 · v1 · pith:C75OYD75new · submitted 2018-09-20 · 🧮 math.RA

When does a semiring become a residuated lattice?

classification 🧮 math.RA
keywords semiringresiduatedcompleteidempotentlatticelatticesarisesassertion
0
0 comments X
read the original abstract

It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The natural question arises if the converse assertion is also true. We show that the conversion is possible provided the given semiring is, moreover, completely distributive. We characterize semirings associated to complete residuated lattices satisfying the double negation law where the assumption of complete distributivity can be omitted. A similar result is obtained for idempotent residuated lattices.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.