Electronic Notes in Theoretical Computer Science · 2001 · 39 citations · 10 references
Natural SciencesComputer ScienceMathematicsAlgebraRepresentation TheorySet TheoryAxiomatic Set TheorySet SystemsBisimulation In LogicLattice ModelsMonoids
Given a V -complete (semi)lattice L , we consider L -labeled transition systems as coalgebras of a functor L (−), associating with a set X the set L X of all L -fuzzy subsets. We describe simulations and bisimulations of L -coalgebras to show that L(−) weakly preserves nonempty kernel pairs iff it weakly preserves nonempty pullbacks iff L is join infinitely distributive (JID). Exchanging L for a commutative monoid M , we consider the functor M (−)ω which associates with a set X all finite multisets containing elements of X with multiplicities m ∈ M. The corresponding functor weakly preserves nonempty pullbacks along injectives iff 0 is the only invertible element of M , and it preserves nonempty kernel pairs iff M is refinable, in the sense that two sum representations of the same value, r1 + … + rm = c1 + … + cn, have a common refinement matrix (m(i, j)) whose k-th row sums to rk and whose l-th column sums to cl for any 1≤ k ≤ m and 1 ≤ l ≤ n.
10
Joseph A. Goguen · Journal of Mathematical Analysis and Applications · 1967 · 2.4K citations
Universal coalgebra: a theory of systems
J.J.M.M. Rutten · Theoretical Computer Science · 2000 · 1.2K citations
Handbook Of Categorical Algebra 1 Basic Category Theory
Francis Borceux · 2008 · 292 citations
Llzlo Lovasz · Acta Mathematica Academiae Scientiarum Hungaricae · 1967 · 214 citations
Lawrence S. Moss · Annals of Pure and Applied Logic · 1999 · 163 citations