The sub algebra functor Sub A is faithful for Boolean algebras (Sub A •Sub B implies A • B, see D. Sachs [7] ), but it is not faithful for bounded distributive lattices or unbounded distributive lattices. The automorphism functor Aut A is highly unfaithful even for Boolean algebras. The endomorphism functor End A is the most faithful of all three. B. M. Schein [8] and K. D.' Magill [5] establis...

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation proof method. If T is a free monad, then such distributive laws correspond...

A PROP is a way of encoding structure borne by an object of a symmetric monoidal category. We describe a notion of distributive law for PROPs, based on Beck’s distributive laws for monads. A distributive law between PROPs allows them to be composed, and an algebra for the composite PROP consists of a single object with an algebra structure for each of the original PROPs, subject to compatibilit...

the purpose of this study was to investigating the effect of organizational justice and organizational citizenship behavior mediated by the quality of work life. population of the study was all male and female staffs' mazandaran university (n=419). research sample was included 156 persons who were selected with random sampling method across staffs' mazandaran university. for data gath...

Let (L, ) be a finite distributive lattice, and suppose that the functions f1, f2 :L→ R are monotone increasing with respect to the partial order . Given μ a probability measure on L, denote by E(fi) the average of fi over L with respect to μ, i = 1,2. Then the FKG inequality provides a condition on the measure μ under which the covariance, Cov(f1, f2) := E(f1f2) − E(f1)E(f2), is nonnegative. I...