✦ LIBER ✦

On the unidimensional fuzzy equivalence relations

✍ Scribed by D. Boixader

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 165 KB
Volume: 14
Category: Article
ISSN: 0884-8173
DOI: 10.1002/(sici)1098-111x(199909)14:9<899::aid-int3>3.0.co;2-8

No coin nor oath required. For personal study only.

✦ Synopsis

The dimension of a fuzzy equivalence relation is the minimum number of fuzzy sets needed to generate it. A general theorem is proved that characterizes unidimensional fuzzy equivalence relations. The multidimensional case is also studied under some Ž . restrictive conditions regular fuzzy equivalence relations .

📜 SIMILAR VOLUMES

On fuzzy preference relations

✍ Sergei Ovchinnikov 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 379 KB

Triangular norms, conorms, and negation functions are used as interpretations for propositional connectives in a multiple-valued logic model for fuzzy binary relations of weak preference, strict preference, and indifference. It is shown that the Law of Contradiction is a necessary condition for the

A Note on Positive Equivalence Relations

✍ A. H. Lachlan 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB

Equivalence Relations on Finite Dynamica

Equivalence Relations on Finite Dynamical Systems

✍ Reinhard Laubenbacher; Bodo Pareigis 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 121 KB

This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a theory of computer simulation. We study finite dynamical systems on binary strings, that is, iterates of functions from 0 1 n to itself. We introduce several equivalence relations on systems and study t

On Σ11 equivalence relations over the na

On Σ11 equivalence relations over the natural numbers

✍ Ekaterina B. Fokina; Sy-David Friedman 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract We study the structure of Σ^1^~1~ equivalence relations on hyperarithmetical subsets of ω under reducibilities given by hyperarithmetical or computable functions, called h‐reducibility and FF‐reducibility, respectively. We show that the structure is rich even when one fixes the number o

On Some Properties of Recursively Enumer

On Some Properties of Recursively Enumerable Equivalence Relations

✍ Stefano Baratella 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

A theorem on ROD-hypersmooth equivalence

A theorem on ROD-hypersmooth equivalence relations in the Solovay model

✍ Vladimir Kanovei; Michael Reeken 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

## Abstract It is known that every Borel hypersmooth but non‐smooth equivalence relation is Borel bi‐reducible to E~1~. We prove a ROD version of this result in the Solovay model.