peer reviewedIn this paper we provide a characterization of the class of idempotent n-ary uninorms on a given chain. When the chain is finite, we also provide anaxiomatic characterization of the latter class by means of four conditions only: associativity, quasitriviality, symmetry, and nondecreasing monotonicity. In particular, we show that associativity can be replaced with bisymmetry in this axiomatization
In this paper we provide an axiomatic characterization of the idempotent discrete uninorms by means ...
We investigate monotone idempotent n-ary semigroups and provide a generalization of the Czogala-Drew...
peer reviewedWe investigate monotone idempotent n-ary semigroups and provide a generalization of the...
In this paper we provide a characterization of the class of idempotent n-ary uninorms on a given cha...
In this paper we are interested in the class of n-ary operations on an arbitrary chain that are quas...
We provide a description of the class of n-ary operations on an arbitrary chain that are quasitrivia...
peer reviewedWe provide a description of the class of n-ary operations on an arbitrary chain that ar...
In this paper we provide visual characterization of associative quasitrivial nondecreasing operation...
International audienceIn this paper we provide an axiomatic characterization of the idempotent discr...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
In this paper we provide an axiomatic characterization of the idempotent discrete uninorms by means ...
We investigate monotone idempotent n-ary semigroups and provide a generalization of the Czogala-Drew...
peer reviewedWe investigate monotone idempotent n-ary semigroups and provide a generalization of the...
In this paper we provide a characterization of the class of idempotent n-ary uninorms on a given cha...
In this paper we are interested in the class of n-ary operations on an arbitrary chain that are quas...
We provide a description of the class of n-ary operations on an arbitrary chain that are quasitrivia...
peer reviewedWe provide a description of the class of n-ary operations on an arbitrary chain that ar...
In this paper we provide visual characterization of associative quasitrivial nondecreasing operation...
International audienceIn this paper we provide an axiomatic characterization of the idempotent discr...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
An n-variable associative function is called reducible if it can be written as a composition of a bi...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
We investigate the class of binary associative and quasitrivial operations on a given finite set. He...
In this paper we provide an axiomatic characterization of the idempotent discrete uninorms by means ...
We investigate monotone idempotent n-ary semigroups and provide a generalization of the Czogala-Drew...
peer reviewedWe investigate monotone idempotent n-ary semigroups and provide a generalization of the...