in this paper, we introduce the notion of multiplier in -algebra and study relationships between multipliers and some special mappings, likeness closure operators, homomorphisms and ( -derivations in -algebras. we introduce the concept of idempotent multipliers in bl-algebra and weak congruence and obtain an interconnection between idempotent multipliers and weak congruences. also, we introduce...

In this paper definitions of many sorted closure system and many sorted closure operator are introduced. These notations are also introduced in [9], but in another meaning. In this article closure system is absolutely multiplicative subset family of many sorted sets and in [9] is many sorted absolutely multiplicative subset family of many sorted sets. Analogously, closure operator is function b...

Recently, in order to broad the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank function, spanning sets and so on. In this paper, we connect the second type of covering-based rough sets and matroids from the view of closure operators. On one hand, we establish a closure system through the fixed ...

In this paper, we show that injectivity with respect to the class $mathcal{D}$  of dense monomorphisms of an idempotent and weakly hereditary closure operator of an arbitrary category  well-behaves. Indeed, if $mathcal{M}$ is a subclass of monomorphisms, $mathcal{M}cap mathcal{D}$-injectivity  well-behaves. We also introduce the notion of $(r,t)$-injectivity in the category {bf S-Act}, where $r...

The main goal of this paper is to introduce and study a new class of function via the notions of $e$-$theta$-open sets and $e$-$theta$-closure operator which are defined by Özkoç and Aslım [10] called weakly $eR$-open functions and $e$-$theta$-open functions. Moreover, we investigate not only some of their basic properties but also their relationships with other types of already existing topolo...

The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composing two closure operators and that the resulting operator is still a closure operator. Also, we extend any similarity into a similarity which is compatible with the logical equivalence, and we prove that this gives the ...

There are examples of algorithms which allow the e cient computation of the concepts of a given formal context. However, when one wants to apply those algorithms to an arbitrary closure operator, which might not be given by a formal context, those algorithms cannot be applied directly. Therefore we want to discuss the problem of nding an appropriate formal context for a given closure operator, ...

We propose a framework for managing resources via convergent operators. Operators represent their need for a resource to a designated resource closure operator that manages the resource. We evaluate a specific design for a resource closure operator by simulation and demonstrate that the operator achieves a near-optimal balance between cost and value without using any model of the relationship b...