Associativity of discretized triangular norms
Di Zhang, Xue-ping Wang
Abstract
In this article, we mainly investigate when the binary operation T[n]:[0, 1]2→ [0, 1] satisfies the associative law and thus becomes a triangular norm where equation* T[n](x,y)=\arrayll fn(T(fn(x),fn(y))), &if\,\, (x,y)∈[0,1)2, \\ \x,y\, &otherwise, array. equation* fn:[0,1]→\0, 1n, 2n, …, n-1n, 1\ given by fn(x)=1n nx with n a positive integer and T:[0, 1]2→ [0, 1] is a triangular norm. We present some sufficient conditions for T[n] to be triangular norms, and for T[n] to be never associative when T is strictly monotonic.
Create a lesson
Related papers
Signed Quantities and Quadrilaterals: Geometry without Cases
George-Rubin Thomas
Zeros and Their Distribution for Leonardo Polynomials
Muhammet Karagöz, Nihal Özgür
How long is a game of Uno? A counting law for large hands and the Wild Draw Four hoard
Pragyaan Gaur
On the Rank Condition for Perfect Cuboids
Valery Asiryan
A Local Proof of Langlands's First Main Lemma for Local Epsilon Factors over Nonarchimedean Local Fields
Fukuhiro Ueda
The first type of power mean bounds for the Gaussian hypergeometric function
Zhen-Hang, Yang, Jing-Feng Tian