It is an open question whether a non-trivial convex combination of triangular norms (resp. conorms) can be a triangular norm (resp. conorm). We investigate the analogous question for S-implications and R-implications.

We prove a sharp convexity bound for L-functions, at the centre of the critical strip, under conditions weaker than those for the Selberg Class. 2000 Mathematics Subject Classification: Primary 11M41

in this paper, new definitions of $l$-fuzzy closure operator, $l$-fuzzy interior operator, $l$-fuzzy remote neighborhood system, $l$-fuzzy neighborhood system and $l$-fuzzy quasi-coincident neighborhood system are proposed. it is proved that the category of $l$-fuzzy closure spaces, the category of $l$-fuzzy interior spaces, the category of $l$-fuzzy remote neighborhood spaces, the category of ...

Abstract In this paper, the notions of subgradmnt, subdifferentla[, and differential with respect to convex fuzzy mappings are investigated, whmh provides the basis for the fuzzy extremum problem theory We consider the problems of minimizing or maximizing a convex fuzzy mapping over a convex set and develop the necessary and/or sufficient optlmahty conditions. Furthermore, the concept of saddle...

The aim of this paper is to propose a convex risk measure in the framework of fuzzy random theory and verify its advantage over the conventional variance approach. For this purpose, this paper defines the quadratic deviation (QD) of fuzzy random variable as the mathematical expectation of QDs of fuzzy variables. As a result, the new risk criterion essentially describes the variation of a fuzzy ...

  In order to have better insight of project characteristics, different kinds of fuzzy analysis for project networks have been recently proposed, most of which consider activities duration as the main and only source of imprecision and vagueness, but as it is usually experienced in real projects, the structure of the network is also subject to changes. In this paper we consider three types of i...

L-convexity, one of the central concepts in discrete convex analysis, receives significant attentions in the operations literature in recent years as it provides a powerful tool to derive structures of optimal policies and allows for efficient computational procedures. In this paper, we present a survey of key properties of L-convexity and some closely related results in lattice programming, se...