Transitive closure and betweenness relations
The paper is concerned with the development of indistinguishability operators being treated as a generalization of equivalence relations. The three general approaches in this regard are (a) max-t composition leading to transitive closures of fuzzy relations, (b) representation theorem in which relations are formed on a basis of a family of fuzzy sets, and (c) building decomposable relations from a fuzzy set.NEWLINENEWLINENEWLINEThe study relates these three approaches in the case of Archimedean t-norms used in the above constructs. It is shown that indistinguishability operators generate metric betweenness relations in the sense of Menger and a structure of these relations depends on their length and dimension (in the general sense that greater dimension implies smaller length).
- Fuzzy \(T\)-transitive relations: Eigenvectors and generators
- scientific article; zbMATH DE number 3870293 (Why is no real title available?)
- scientific article; zbMATH DE number 763728 (Why is no real title available?)
- On a geometric combinatorial problem
- On the combinatorial problems which I would most like to see solved
- On the structure of F-indistinguishability operators
- One-dimensional indistinguishability operators
- Similarity relations - the calculation of minimal generating families
- Similarity relations and fuzzy orderings
- Equivalence operators in nilpotent systems
- Symmetric difference operators based on thresholds
- A study on the relationship between relaxed metrics and indistinguishability operators
- Fuzzy equivalence relations and their equivalence classes
- Transitive closures of binary relations. IV
- Indistinguishability operators with respect to different t-norms
- Many-valued preorders. II: The symmetry axiom and probabilistic geometry
- scientific article; zbMATH DE number 2186890 (Why is no real title available?)
- scientific article; zbMATH DE number 1495522 (Why is no real title available?)
- Equivalence operators that are associative
- Nested Pebbles and Transitive Closure
- THE LENGTH AND BETWEENNESS RELATIONS OF INDISTINGUISHABILITY OPERATORS
- Indistinguishability operators. Modelling fuzzy equalities and fuzzy equivalence relations
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
This page was built for publication: Transitive closure and betweenness relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939643)