The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 81 –
100 of
294
We propose a generalization of simple coalition games in the context of games with fuzzy coalitions. Mimicking the correspondence of simple games with non-constant monotone formulas of classical logic, we introduce simple Łukasiewicz games using monotone formulas of Łukasiewicz logic, one of the most prominent fuzzy logics. We study the core solution on the class of simple Łukasiewicz games and show that cores of such games are determined by finitely-many linear constraints only. The non-emptiness...
This paper is devoted to the study of two kinds of implications on a finite chain : -implications and -implications. A characterization of each kind of these operators is given and a lot of different implications on are obtained, not only from smooth t-norms but also from non smooth ones. Some additional properties on these implications are studied specially in the smooth case. Finally, a class of non smooth t-norms including the nilpotent minimum is characterized. Any t-norm in this class...
El contenido de este trabajo tiene un objetivo fundamental: el estudio, clasificación y caracterización de las isometrías de un grupo reticulado. Se introducen los conceptos de grupo de isometrías M(G) de un grupo reticulado G, grupo de simetrías homogéneas H(G) y traslaciones T(G). Se estudia primero el caso elemental de los grupos totalmente ordenados y utilizando luego las representaciones de los grupos (y f-anillos) en un producto de totalmente ordenados, se introduce el concepto de conjunto...
We propose an efficient method for finding a Chebyshev-best soluble approximation to an insoluble system of linear equations over max-plus algebra.
For ordered (= partially ordered) sets we introduce certain cardinal characteristics of them (some of those are known). We show that these characteristics—with one exception—coincide.
Currently displaying 81 –
100 of
294