Copower functors

Theoretical Computer Science - Tập 410 - Trang 1129-1142 - 2009
H. Peter Gumm1
1Philipps-Universität Marburg, Hans Meerwein Strasse, 35032 Marburg, Germany

Tài liệu tham khảo

Corradini, 1998, Structured transition systems as lax coalgebras, vol. 11 Dobbertin, 1983, Refinement monoids, Vaught monoids, and Boolean algebras, Mathematische Annalen, 265, 475, 10.1007/BF01455948 Ferrari, 1997, Structured transition systems with parametric observations: Observational congruences and minimal realizations, Mathematical Structures in Computer Science, 7, 241, 10.1017/S0960129597002284 Grätzer, 1979 Gumm, 2001, Monoid-labeled transition systems, Electronic Notes in Theoretical Computer Science, 44, 184, 10.1016/S1571-0661(04)80908-3 Gumm, 2005, Types and coalgebraic structure, Algebra Universalis, 53, 229, 10.1007/s00012-005-1888-2 McKnight, 1969, Equidivisible semigroups, Journal of Algebra, 12, 24, 10.1016/0021-8693(69)90015-5 Pultr, 1968, A remark on selective functors, Commentationes Mathematicae Universitatis Carolinae, 9, 191 Rutten, 2000, Universal coalgebra: A theory of systems, Theoretical Computer Science, 249, 3, 10.1016/S0304-3975(00)00056-6 Schröder, 2005, Expressivity of coalgebraic modal logic: The limits and beyond, vol. 3441, 440 Sikorski, 1952, Products of abstract algebras, Fundamenta Mathematicae, 39, 211, 10.4064/fm-39-1-211-228 A. Sokolova, Coalgebraic analysis of probabilistic systems, Ph.D. Thesis, Technical University Eindhoven, 2005 Trnková, 1969, Some properties of set functors, Commentationes Mathematicae Universitatis Carolinae, 10, 323 Daniele Turi, Gordon Plotkin, Towards a mathematical operational semantics. lics, 00:280, 1997