Multi-diagrams of relations between fuzzy sets: weighted limits, colimits and commutativity

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

NY.: Ithaca, Cornell University Library, 2016. — 26 p. English. (OCR-слой).
{Free Published: Cornell University Library (arXiv:1604.02784v1 [cs.LO] 11 Apr 2016)}.
[Carlos Leandro. Departamento de Matematica, Instituto Superior de Engenharia de Lisboa, Portugal.
Luis Monteiro. CITI, Departamento de Informatica, Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, Portugal].
Abstract.
Limits and colimits of diagrams, defined by maps between sets, are universal constructions fundamental in different mathematical domains and key concepts in theoretical computer science. Its importance in semantic modeling is described by M. Makkai and R. Par´e in [1], where it is formally shown that every axiomatizable theory in classical infinitary logic can be specified using diagrams defined by maps between sets, and its models are structures characterized by the commutativity, limit and colimit of those diagrams. Z. Diskin in [2], taking a more practical perspective, presented an algebraic graphic-based framework for data modeling and database design.
The aim of our work is to study the possibility of extending these algebraic frameworks to the specification of fuzzy structures and to the description of fuzzy patterns on data.
For that purpose, in this paper we describe a conservative extension for the notions of diagram commutativity, limit and colimit, when diagrams are constructed using relations between fuzzy sets, evaluated in a multi-valued logic.
These are used to formalize what we mean by “a relation R is similar to a limit of diagram D,” “a similarity relation S is identical to a colimit of diagram D colimit,” and “a diagram D is almost commutative".
Introduction.
Preliminaries.
Multi-categories.
Example (Diers’ completion).
Example (Free product completion).
Algorithm. Gluing words.
Monoidal symmetric category.
Definition. A complete residuated lattice (CRlattice for short) is an algebra.
Definition. (multi-limit).
Relations evaluated in Ω.
Logical extension for universal properties.
The Ω-multi-category RelΩ.
Weighted limits in RelΩ.
Commutative multi-diagrams.
Conclusions and future work.
References (11 publ).

Author(s): Leandro C., Monteiro L.

Language: English
Commentary: 1939307
Tags: Математика;Математическая логика;Нечеткая логика;Нечеткие множества