We show how the firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. On that basis we introduce closed monoidal structures which are residuated monoids. We identify a class of closed monoidal structures (associated with a family of idempotent group dioids) for which one can mimic the token game of Petri nets to define the behaviour of these ...

In this paper, we investigate functorial relations between Alexandrov fuzzy topologies and upper approximation operators in complete residuated lattices. We present some examples. AMS Subject Classification: 03E72, 03G10, 06A15, 06F07, 54A40

The main part of the theory of residuated groupoids has been technical and the results apparently diverse in nature. However P. Dubreil and R. Croisot [5], using the concepts of residuated and residual maps, were able to present the basic properties of residuals in a simple unified manner. R. Croisot [3] carried on this study. In this paper we build a theory of residuated and residual maps whic...

At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...

This contribution focuses on inverse fuzzy transforms (shortly inverse F-transforms) over residuated lattices introduced by I. Perfilieva and their approximation properties. We will try to reduce some requirements used in the original work to prove Approximation theorem. Moreover, we show in which sense F-transforms are the best approximations. Keywords— Fuzzy transform, Approximation, Extensio...

In this talk we are going to explore an interesting connection between the famous Burnside problem for groups, regular languages, and residuated lattices. Let K be a finitely axiomatized class of residuated lattices. Recall that the usual way of proving decidability of universal theory for K is to establish that K has the finite embeddability property (FEP) [2, 3]. It turns out that the method ...

Residuated structures are important lattice-ordered algebras both for mathematics and for logics; in particular, the development of lattice-valued mathematics and related non-classical logics is based on a multitude of lattice-ordered structures that suit for many-valued reasoning under uncertainty and vagueness. Extended-order algebras, introduced in [10] and further developed in [1], give an ...