Relation Liftings on Preorders and Posets

  • Marta Bílková
  • Alexander Kurz
  • Daniela Petrişan
  • Jiří Velebil
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6859)

Abstract

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss’s coalgebraic over posets.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABSV]
    Adámek, J., El Bashir, R., Sobral, M., Velebil, J.: On functors that are lax epimorphisms. Theory Appl. Categ. 8.20, 509–521 (2001)Google Scholar
  2. [BK]
    Balan, A., Kurz, A.: Finitary Functors: from Set to Preord and Poset. In: Corradini, A., Klin, B., Crstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 85–99. Springer, Heidelberg (2011)Google Scholar
  3. [Bal]
    Baltag, A.: A logic for coalgebraic simulation. Electron. Notes Theor. Comput. Sci. 33, 41–60 (2000)MathSciNetGoogle Scholar
  4. [Ba]
    Barr, M.: Relational algebras. In: Reports of the Midwest Category Seminar IV. Lecture Notes in Mathematics, vol. 137, pp. 39–55. Springer, Heidelberg (1970)CrossRefGoogle Scholar
  5. [BV]
    El Bashir, R., Velebil, J.: Reflective and coreflective subcategories of presheaves. Theory Appl. Categ. 10.16, 410–423 (2002)Google Scholar
  6. [CKW]
    Carboni, A., Kelly, G.M., Wood, R.J.: A 2-categorical approach to change of base and geometric morphisms I. Cahiers de Top. et Géom. Diff. XXXII.1, 47–95 (1991)MathSciNetGoogle Scholar
  7. [Gu]
    Guitart, R.: Relations et carrés exacts. Ann. Sci. Math. Québec IV.2, 103–125 (1980)MathSciNetGoogle Scholar
  8. [He]
    Hermida, C.: A categorical outlook on relational modalities and simulations, preprint, http://maggie.cs.queensu.ca/chermida/papers/sat-sim-IandC.pdf
  9. [HeJ]
    Hermida, C., Jacobs, B.: Structural induction and coinduction in the fibrational setting. Inform. and Comput. 145, 107–152 (1998)MathSciNetMATHCrossRefGoogle Scholar
  10. [HuJ]
    Hughes, J., Jacobs, B.: Simulations in coalgebra. Theor. Comput. Sci. 327, 71–108 (2004)MathSciNetMATHCrossRefGoogle Scholar
  11. [KaKuV]
    Kapulkin, K., Kurz, A., Velebil, J.: Expressivity of Coalgebraic Logic over Posets. In: CMCS 2010 Short contributions, CWI Technical report SEN-1004, pp. 16–17 (2010)Google Scholar
  12. [Ke]
    Kelly, G.M.: Basic concepts of enriched category theory. London Math. Soc. Lecture Notes Series, vol. 64. Cambridge Univ. Press, New York (1982)MATHGoogle Scholar
  13. [Kl]
    Klin, B.: An Abstract Coalgebraic Approach to Process Equivalence for Well-Behaved Operational Semantics. University of Aarhus (2004)Google Scholar
  14. [KKuV]
    Kupke, C., Kurz, A., Venema, Y.: Completeness of the finitary Moss logic. In: Advances in Modal Logic, pp. 193–217. College Publications (2008)Google Scholar
  15. [KuL]
    Kurz, A., Leal, R.: Equational coalgebraic logic. Electron. Notes Theor. Comput. Sci. 249, 333–356 (2009)CrossRefGoogle Scholar
  16. [L]
    Levy, P.B.: Similarity quotients as final coalgebras. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 27–41. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  17. [M_1]
    Marmolejo, F.: Doctrines whose structure forms a fully faithful adjoint string. Theor. Appl. Categ. 3(2), 24–44 (1997)MathSciNetMATHGoogle Scholar
  18. [M_2]
    Marmolejo, F.: Distributive laws for pseudomonads. Theor. Appl. Categ. 5(5), 91–147 (1999)MathSciNetMATHGoogle Scholar
  19. [MRW]
    Marmolejo, F., Rosebrugh, R., Wood, R.J.: Duality for CCD lattices. Theor. Appl. Categ. 22(1), 1–23 (2009)MathSciNetMATHGoogle Scholar
  20. [Mo]
    Moss, L.: Coalgebraic logic. Ann. Pure Appl. Logic 96, 277–317 (1999)MathSciNetMATHCrossRefGoogle Scholar
  21. [R]
    Rutten, J.: Relators and Metric Bisimulations (Extended Abstract). Electr. Notes Theor. Comput. Sci. 11, 252–258 (1998)MathSciNetCrossRefGoogle Scholar
  22. [S_1]
    Street, R.: The formal theory of monads. J. Pure Appl. Algebra 2, 149–168 (1972)MathSciNetMATHCrossRefGoogle Scholar
  23. [S_2]
    Street, R.: Fibrations and Yoneda’s lemma in a 2-category. In: Category Seminar, Sydney 1974. Lecture Notes in Mathematics, vol. 420, pp. 104–133 (1974)Google Scholar
  24. [S_3]
    Street, R.: Elementary cosmoi I. In: Category Seminar, Sydney 1974. Lecture Notes in Mathematics, vol. 420, pp. 134–180. Springer, Heidelberg (1974)CrossRefGoogle Scholar
  25. [S_4]
    Street, R.: Fibrations in bicategories. Cahiers de Top. et Géom. Diff. XXI.2, 111–159 (1980)MathSciNetGoogle Scholar
  26. [V]
    Venema, Y.: Automata and fixed point logic: a coalgebraic perspective. Inform. and Comput. 204.4, 637–678 (2006)MathSciNetCrossRefGoogle Scholar
  27. [Wo]
    Worrell, J.: Coinduction for recursive data types: partial orders, metric spaces and Ω-categories. Electron. Notes Theor. Comput. Sci. 33, 337–356 (2000)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Marta Bílková
    • 1
  • Alexander Kurz
    • 2
  • Daniela Petrişan
    • 2
  • Jiří Velebil
    • 3
  1. 1.Faculty of PhilosophyCharles UniversityPragueCzech Republic
  2. 2.Department of Computer ScienceUniversity of LeicesterUnited Kingdom
  3. 3.Faculty of Electrical EngineeringCzech Technical UniversityPragueCzech Republic

Personalised recommendations