### Recent Submissions

• #### One-dimensional T-preorders ﻿

(IOS Press, 2014)
Conference report
Open Access
This paper studies T-preorders by using their Representation Theorem that states that every T-preorder on a set X can be generated in a natural way by a family of fuzzy subsets of X. Especial emphasis is made on the study ...
• #### Indistinguishability operators generated by fuzzy numbers ﻿

(Institute of Electrical and Electronics Engineers (IEEE), 2004)
Conference report
Restricted access - publisher's policy
A new way to generate indistinguishability operators coherent with the underlying ordering structure of the real Dine is given in the sense that this structure should be compatible with the betweenness relation generated ...
• #### Eigenvectors and generators of fuzzy relations ﻿

(-, 1992)
Conference report
Restricted access - publisher's policy
A new geometric approach to the study of the eigenvectors is provided. The T-eigenvectors of a T-indistinguishability operator are characterized as its generators in the sense of the representation theorem of L. Valverde ...
• #### Fuzzy numbers and equality relations ﻿

(IEEE pub., 1993)
Conference report
Restricted access - publisher's policy
A general approach to the concept of fuzzy number associated to a generalized equality on the real line is given. As a result, the use of triangular and trapezoidal fuzzy numbers, among other types, is justified and a ...
• #### ET-Lipschitzian aggregation operators ﻿

(-, 2007)
Conference report
Open Access
Lipschitzian and kernel aggregation operators with respect to the natural Tindistinguishability operator ET and their powers are studied. A t-norm T is proved to be ET -lipschitzian, and is interpreted as a fuzzy point and ...
• #### Finding close T-indistinguishability operators to a given proximity ﻿

(-, 2007)
Conference report
Open Access
Two ways to approximate a proximity relation R (i.e. a reflexive and symmetric fuzzy relation) by a T-transitive one where T is a continuous archimedean t-norm are given. The first one aggregates the transitive closure R ...
• #### Aggregation operators and the Lipschitzian condition ﻿

(IEEE Comp. Int. Soc., 2007)
Conference report
Open Access
Lipschitzian and kernel aggregation operators with respect to the natural T-indistinguishability operator ET and their powers are studied. A t-norm T is proved to be ETLipschitzian, and is interpreted as a fuzzy point and ...
• #### La Hoja de cálculo : un entorno para la enseñanza y estudio de relaciones borrosas ﻿

(Center for Soft Computing, 2008)
Conference report
Open Access
En este trabajo se estudia la posibilidad de introduir conceptos de teoría de conjuntos borrosos en los currículos correspondientes a distintos niveles de enseñanza. Se hace especial hincapié en la enseñanza de las relaciones ...
• #### Estructura de las similitudes ﻿

(Center for Soft Computing, 2008)
Conference report
Open Access
En este artículo se define formalmente el concepto de estructura de similaridad, se cuenta el número de estructuras de similaridades hasta dimensión 5, se propone una nomenclatura y un algoritmo que asigna una estructura ...
• #### Aproximación de Proximidades por Similitudes ﻿

(Center for Soft Computing, 2008)
Conference report
Open Access
En este trabajo se presenta un algoritmo para hallar una relaci´on de similitud próxima a una relación de proximidad (i.e.: una relación de tolerancia) R dada. La relación de similitud obtenida es más próxima a R que su ...
• #### Approximating proximities by similarities ﻿

(Univ. Malaga, 2008)
Conference report
Open Access
In this paper an algorithm to find a similarity close to a proximity or tolerance relation R is given. The obtained similarity is closer to R than its transitive closure or any transitive opening of R.
• #### Approximate fuzzy preorders and equivalences ﻿

(2009)
Conference report
Restricted access - publisher's policy
Although Fuzzy Preorders and Fuzzy Equivalences are well established types of fuzzy relations, they are defined in terms of properties to be fulfilled in a crisp way. In this paper we relax those requirements by making ...