Triangular norms, or t-norms for short, play an important role for the semantics of fuzzy logics. Although an enormous number of examples and a remarkable number of construction methods for this kind of operation has been established, a uniform approach is still outstanding. This paper is devoted to a specific algebraic-geometrical framework within which t-norms, up to isomorphism, can be descr...

Triangular norms in the study of probabilistic metric spaces as a special kind of associative functions defined on the unit interval. These functions have found applications in many areas since then. In this study, we present new methods for constructing triangular norms and triangular conorms on an arbitrary bounded lattice under some constraints. Also, we give some illustrative examples for t...

PURPOSE Reliable change indices (RCIs) and standardized regression-based (SRB) change scores norms were established for the recently revised Wechsler Adult Intelligence Scale-III (WAIS-III) and Wechsler Memory Scale-III (WMS-III) in patients with complex partial seizures. Establishment of such standardized change scores can be useful in determining the effects of epilepsy surgery on cognitive f...

The Archimedean components of triangular norms (which turn the closed unit interval into an abelian, totally ordered semigroup with neutral element 1) are studied, in particular their extension to triangular norms, and some construction methods for Archimedean components are given. The triangular norms which are uniquely determined by their Archimedean components are characterized. Using ordina...

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices; (ii) under some further independent conditions, the normalized largest eigenvalues of the Laplacian matrices are dense in a compact interval ...

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices; (ii) under some further independent conditions, the normalized largest eigenvalues of the Laplacian matrices are dense in a compact interval a...