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...

First, we introduce the concept of intuitionistic fuzzy group congruenceand we obtain the characterizations of intuitionistic fuzzy group congruenceson an inverse semigroup and a T^{*}-pure semigroup, respectively. Also,we study some properties of intuitionistic fuzzy group congruence. Next, weintroduce the notion of intuitionistic fuzzy semilattice congruence and we givethe characterization of...

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...

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...

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...

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

Let f be an integer greater than one. We study three progressively finer equivalence relations on closed 3-manifolds generated by Dehn surgery with denominator f : weak f -congruence, f -congruence, and strong f -congruence. If f is odd, weak f -congruence preserves the ring structure on cohomology with Zf -coefficients. We show that strong f -congruence coincides with a relation previously stu...

A notion of refinement for concurrent object-oriented programs was originally presented in [3]. ln th.is article we prove that the refinement relation associated to this notion is a congruence with respect to various standard programming language constructors, including parallel and sequential composition, conditionals, and nondeterministic internal choice. We also establish a weaker compositio...