Since congruence modulo m is an equivalence relation, it partitions the universe of integers into equivalence classes, which we’ll call congruence classes modulo m. Within any one of these classes, all of the members are congruent to all of the other members; but congruence modulo m never holds between members of different equivalence classes. For instance, there are two congruence classes modu...

EQ-algebras were introduced by Novak (2006) as an algebraic structure of truth values for fuzzy-type theory (FFT). Novák and De Baets (2009) various kinds such good, residuated, IEQ-algebras. In this paper, we define the notion (pre)ideal in bounded (BEQ-algebras) investigate some properties. Then, introduce a congruence relation on good BEQ-algebras using ideals, then, solve open problem Paad ...

Starting with the underlying motivation of developing a general theory of L-fuzzy sets where L is a multilattice (a particular case of non-deterministic algebra), we study the relationship between the crisp notions of congruence, homomorphism and substructure on some non-deterministic algebras which have been used in the literature, i.e. hypergroups, and join spaces. Moreover, we provide suitab...

in this paper we introduce the notions of fuzzy transposition hypergroupsand fuzzy regular relations and investigate their basic properties.we also study fuzzy quotient hypergroups of a fuzzy transposition hypergroup.

A. Reduction-closed barbed congruence (Section II) Definition 28 (Reduction-closed barbed congruence). Let L be a process calculus, in which a reduction relation −→L and barb predicates ↓a , for each a in a given set of names, have been defined. A relationR on the processes of L is context-closed if PRQ implies C[P ]RC[Q], for each context C of L; the relation is barb-preserving if for any name...

in this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-lukasiewicz operator. in fact lukasiewicz t-norm is one of the four basic t-norms. a new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on ...

the starting point of this paper is given by priestley’s papers, where a theory of representation of distributive lattices is presented. the purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. in this way, some results of priestley’s papers are extended. in the main theorem, we show that the category of finite fuzzy priestley space...

in this paper, we study the finitely many constraints of the fuzzyrelation inequality problem and optimize the linear objectivefunction on the region defined by the fuzzy max-product operator.simplification operations have been given to accelerate theresolution of the problem by removing the components having noeffect on the solution process. also, an algorithm and somenumerical and applied exa...

We propose a term rewriting approach to verify observational congruence between guarded recursive (finite-state) CCS expressions. Starting from the complete axiomatization of observational congruence for this subset of CCS, a non-terminating rewriting relation has been defined. This rewriting relation is co-canonical over a subclass of infinite derivations, structured fair derivations, which co...

It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...