Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 132
Number of items: 132
  • Goldblatt, R., Hodkinson, I., & Venema, Y. (2004). Erdös graphs resolve Fine's canonicity problem. The Bulletin of Symbolic Logic, 10, 186-208. https://doi.org/10.2178/bsl/1082986262
  • Venema, Y. (2004). A dual characterization of subdirectly irreducible BAOs. Studia Logica, 77, 105-115.
  • Venema, Y. (2004). Automata and fixed point logics for coalgebras. Electronic Notes in Theoretical Computer Science, 106, 355-375.
  • Kupke, C. A., Kurz, A., & Venema, Y. (2004). Stone Coalgebras. Theoretical Computer Science, 327, 109-134. https://doi.org/10.1016/j.tcs.2004.07.023
  • Goldblatt, R., Hodkinson, I., & Venema, Y. (2003). Erdös graphs resolve Fine's canonicity problem. (Technical Reports; No. PP-2003-26). Institute for Logic, Language and Computation.
  • Hodkinson, I., & Venema, Y. (2003). Canonical varieties with no canonical axiomatisation. (Technical Reports; No. PP-2003-13). Institute for Logic, Language and Computation.
  • Kupke, C. A., Kurz, A., & Venema, Y. (2003). Stone coalgebras. (Technical Reports; No. PP-2003-15). Institute for Logic, Language and Computation.
  • Goldblatt, R., Hodkinson, I., & Venema, Y. (2003). On canonical modal logics that are not elementarily generated. Logique et Analyse, 181, 77-101.
  • Kurz, A., Kupke, C. A., & Venema, Y. (2003). Stone coalgebras. Electronic Notes in Theoretical Computer Science, 82(1).
  • Piazza, C., Goguadze, G., & Venema, Y. (2003). Simulating polyadic modal logics by monadic ones. Journal of Symbolic Logic, 68, 419-462. https://doi.org/10.2178/jsl/1052669058
Page 10 of 14