The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterize varieties whose tolerances are homomorphic images of their congruences (TImC). As corollaries, we prove that the variety of semilattices, all varieties of lattices, and all varieties of unary algebras h...

A (distributive) p-algebra is an algebra 〈L;∨,∧, ∗, 0, 1〉 whose reduct 〈L;∨,∧, 0, 1〉 is a bounded (distributive) lattice and whose unary operation ∗ is characterized by x ≤ a if and only if a ∧ x = 0. If L is a p-algebra, B(L) = { x ∈ L : x = x } and D(L) = { x ∈ L : x = 1 } then 〈B(L);∪,∧, 0, 1〉 is a Boolean algebra when a ∪ b is defined to be (a∗ ∧ b∗)∗, for any a, b ∈ B(L), D∗(L) = { x ∨ x∗ ...

between organizational intelligence and empowerment.the research method is survey and the statistical population of the study includes 392 employees of payam noor university of kerman province. measurment tool includes two questionnaires: 1- albercht’s 49-item questionnaire 2- empowerment 15-item questionnaire. the sample of this research is equal to the statistical population so 392employees h...

Inference mechanisms and interpretations of fuzzy rule bases are studied together from the point of view of systems of fuzzy relation equations. A proper use of an inference mechanism connected to a fuzzy relation interpreting a fuzzy rule base is certified by keeping the fundamental interpolation condition. The paper aims at new solutions of systems of fuzzy relation equations which are motiva...

Coinduction is a method of growing importance in reasoning about functional languages, due to the increasing prominence of lazy data structures. Through the use of bisimulations and proofs that observational equivalence is a congruence in various domains it can be used to proof the congruence of two processes. Several proof tools have been developed to aid coinductive proofs but all require use...

Min-implication fuzzy relation equations based on Booleantype implications can also be viewed as a way of implementing fuzzy associative memories with perfect recall. In this paper, fuzzy associative memories with perfect recall are constructed, and new on-line learning algorithms adapting the weights of its interconnections are incorporated into this neural network when the solution set of the...

We give two proofs that the 3–torus is not weakly d–congruent to #S × S, if d > 2. We study how cohomology ring structure relates to weak congruence. We give an example of three 3–manifolds which are weakly 5–congruent but are not 5–congruent. Let d be an integer greater than one. In [G], we considered two equivalence relations generated by restricted surgeries on oriented closed 3–manifolds. W...

It is given a new algorithm to compute a lower T-transitive approximation of a fuzzy relation that preserves symmetry. Given a reflexive and symmetric fuzzy relation, the new algorithm computes a T-indistinguishability that is contained in the fuzzy relation. It has been developed a C++ program that generates random symmetric fuzzy relations or random symmetric and reflexive fuzzy relations and...

Connected Shimura varieties are the quotients of hermitian symmetric domains by discrete groups defined by congruence conditions. We examine their relation with moduli varieties.