Duality for a class of binary operations on [0, 1] (Q1197815): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q202382 |
||
Property / reviewed by | |||
Property / reviewed by: Palaniappan Kannappan / rank | |||
Revision as of 21:01, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Duality for a class of binary operations on [0, 1] |
scientific article |
Statements
Duality for a class of binary operations on [0, 1] (English)
0 references
16 January 1993
0 references
Many authors have considered duality relations between two binary operations on [0,1]. Most of these relations have the form \(NT(x,y)=S(N(x)\), \(N(y))\), where \(T\) is a \(t\)-norm \((T\) is associative, commutative, non-decreasing in each place and such that \(T(x,1)=x\) for all \(x\) in [0,1]), \(S\) is a \(t\)-conorm \((S\) is associative, commutative, non-decreasing in each place and such that \(S(x,0)=x\) for all \(x\) in [0,1] and \(N\) is a strong negation on [0,1] \((N\) non-increasing and involutive). In many cases \(N(x)=1-x\) has been used as duality function and from it we have, for example, the following well known pairs of dual operations: \(T(x,y)=\text{Min}(x,y)\), \(S(x,y)=\text{Max}(x,y)\); \(T(x,y)=\text{Max}(0,x+y-1)\), \(S(x,y)=\text{Min}(1,x+y)\). Let \(T\) and \(S\) be binary operations satisfying the boundary conditions: (1a) \(T(x,0)=T(0,x)=T(1,0)x\), (1b) \(T(x,1)=T(1,x)=(1-T(1,0))x+T(1,0)\). Let \(\Phi\) be the set of binary operations \(F\) on [0,1] satisfying (1) with \(F(0,1)\notin\{0,1\}\). Theorem. Let \(T\in\Phi\). For each \(0<k'<1\), there exists a unique \(S\in\Phi\) with \(S(1,0)=k'\) and a unique \(N:[0,1]\to[0,1]\) such that \((T,S)\) is \(N\)-dual.
0 references
dual operations
0 references
functional equation system
0 references
duality
0 references
binary operations
0 references