Related papers: Operators induced by fuzzy relations
In fairly elementary terms this paper presents how the theory of preordered fuzzy sets, more precisely quantale-valued preorders on quantale-valued fuzzy sets, is established under the guidance of enriched category theory. Motivated by…
Logical relations built on top of an operational semantics are one of the most successful proof methods in programming language semantics. In recent years, more and more expressive notions of operationally-based logical relations have been…
The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…
Poly-infix operators and operator families are introduced as an alternative for working modulo associativity and the corresponding bracket deletion convention. Poly-infix operators represent the basic intuition of repetitively connecting an…
Our aim in this paper is to introduce the relatively new concept of *-density of a fuzzy graph and *-balanced fuzzy graph. Several examples and results are also provided. In addition, many operations on fuzzy graphs that preserves…
In this exposition, I discuss several developments in the theory of vertex operator algebras, and I include motivation for the definition.
Current intent classification approaches assign binary intent class memberships to natural language utterances while disregarding the inherent vagueness in language and the corresponding vagueness in intent class boundaries. In this work,…
The treatment of complex systems often requires the manipulation of vague, imprecise and uncertain information. Indeed, the human being is competent in handling of such systems in a natural way. Instead of thinking in mathematical terms,…
In this work we address the classical problem of classifying tuples of linear operators and linear functions on a finite dimensional vector space up to base change. Having adopted for the situation considered a construction of framed moduli…
This note is a complement to Pusz--Woronowicz's works on functional calculus for two positive forms from the viewpoint of operator theory. Based on an elementary, self-contained and purely Hilbert space operator explanation of their…
In these proceedings we summarize previous work where we formalize a general concept of algebraic field theories using operads. After giving a gentle reminder of algebraic quantum field theory, operads and their algebras, we construct field…
We introduce the concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set. By using this new idea, we introduce the notions of interval valued $(\in,\ivq)$-fuzzy filters of pseudo $BL$-algebras and…
Graph theory has successfully used to solve a wide range of problems encountered in diverse fields such as medical sciences, neural networks, control theory, transportation, clustering analysis, expert systems, image capturing, and network…
After giving some definitions for vertex operator SUPERalgebras and their modules, we construct an associative algebra corresponding to any vertex operator superalgebra, such that the representations of the vertex operator algebra are in…
Within the framework proposed in this paper, we address the issue of extending the certain networks to a fuzzy certain networks in order to cope with a vagueness and limitations of existing models for decision under imprecise and uncertain…
We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…
In this paper some fundamental relationships of a gamma semigroup and its operator semigroups in terms of intuitionistic fuzzy subsets, intuitionistic fuzzy ideals, intuitionistic fuzzy prime(semiprime) ideals, intuitionistic fuzzy ideal…
We introduce a general theory of epistemic random fuzzy sets for reasoning with fuzzy or crisp evidence. This framework generalizes both the Dempster-Shafer theory of belief functions, and possibility theory. Independent epistemic random…
Notions of computation can be modelled by monads. Algebraic effects offer a characterization of monads in terms of algebraic operations and equational axioms, where operations are basic programming features, such as reading or updating the…
The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…