
doi: 10.2307/2045882
A binary operation on [0,1] which is associative, commutative, nondecreasing in each place, and has 1 as a unit element is said to be a t-norm. An example of continuous convex t-norm is \(W(x,y)=Max(x+y-1,0),\) x,y\(\in [0,1]\). The authors prove that smooth convex t-norms do not exist.
convexity, Systems of functional equations and inequalities, binary operation, Convexity of real functions of several variables, generalizations, continuous convex t-norm
convexity, Systems of functional equations and inequalities, binary operation, Convexity of real functions of several variables, generalizations, continuous convex t-norm
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
