Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 130
Number of items: 130
  • Open Access
    Grandi, U. (2012). Binary aggregation with integrity constraints. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Venema, Y. (2012). Algebra en coalgebra: bespiegelingen in de logica. Universiteit van Amsterdam. http://www.oratiereeks.nl/upload/pdf/PDF-6263weboratie_Venema.pdf
  • Open Access
    Kupke, C., Kurz, A., & Venema, Y. (2012). Completeness for the coalgebraic cover modality. Logical Methods in Computer Science, 8(3), Article 2. https://doi.org/10.2168/LMCS-8(3:2)2012
  • Bergfeld, J., & Venema, Y. (2011). Model constructions for Moss' coalgebraic logic. In A. Corradini, B. Klin, & C. Cîrstea (Eds.), Algebra and Coalgebra in Computer Science: 4th International Conference, CALCO 2011, Winchester, UK, August 30-September 2, 2011: proceedings (pp. 100-114). (Lecture Notes in Computer Science; Vol. 6859). Springer. https://doi.org/10.1007/978-3-642-22944-2_8
  • Bílková, M., Velebil, J., & Venema, Y. (2011). On monotone modalities and adjointness. Mathematical Structures in Computer Science, 21, 383-416. https://doi.org/10.1017/S0960129510000514
  • Cirstea, C., Kurz, A., Pattinson, D., Schröder, L., & Venema, Y. (2011). Modal logics are coalgebraic. Computer Journal, 54(1), 31-41. https://doi.org/10.1093/comjnl/bxp004
  • Open Access
    Leal, R. A. (2011). Modalities through the looking glass: a study on coalgebraic modal logics and their applications. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Bezhanishvili, N., Fontaine, G., & Venema, Y. (2010). Vietoris bisimulations. Journal of Logic and Computation, 20(5), 1017-1040. https://doi.org/10.1093/logcom/exn091
  • Schröder, L., & Venema, Y. (2010). Flat coalgebraic fixed point logics. In P. Gastin, & F. Laroussinie (Eds.), CONCUR 2010 - Concurrency Theory: 21st international conference, CONCUR 2010, Paris, France, August 31-September 3, 2010 : proceedings (pp. 524-538). (Lecture Notes in Computer Science; Vol. 6269), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-642-15375-4_36
  • Fontaine, G., Leal, R., & Venema, Y. (2010). Automata for Coalgebras: an approach using predicate liftings. In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, & P. G. Spirakis (Eds.), Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings (Vol. 2, pp. 381-392). (Lecture Notes in Computer Science; Vol. 6199), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-642-14162-1_32
Page 6 of 13