Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 18
Number of items: 18
  • Kupke, C., Marti, J., & Venema, Y. (2022). Size measures and alphabetic equivalence in the µ-calculus. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Article 18 The Association for Computing Machinery. https://doi.org/10.1145/3531130.3533339
  • Open Access
    Kupke, C., Marti, J., & Venema, Y. (2022). Succinct Graph Representations of µ-Calculus Formulas. In F. Manea, & A. Simpson (Eds.), 30th EACSL Annual Conference on Computer Science Logic: CSL 2022, February 14–19, 2022, Göttingen, Germany (Virtual Conference) Article 29 (Leibniz International Proceedings in Informatics; Vol. 216). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2022.29, https://doi.org/10.48550/arXiv.2010.14430
  • Open Access
    Kupke, C., Marti, J., & Venema, Y. (2021). On the size of disjunctive formulas in the µ-calculus. Electronic Proceedings in Theoretical Computer Science, 346, 291-307. https://doi.org/10.4204/EPTCS.346.19
  • Enqvist, S., Hansen, H. H., Kupke, C., Marti, J., & Venema, Y. (2019). Completeness for game logic. In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019): Vancouver, British Columbia, Canada, 24-27 June 2019 (pp. 307-319). IEEE. https://doi.org/10.1109/LICS.2019.8785676
  • Hansen, H. H., Kupke, C., Marti, J., & Venema, Y. (2018). Parity Games and Automata for Game Logic. In A. Madeira, & M. Benevides (Eds.), Dynamic Logic. New Trends and Applications: First International Workshop, DALI 2017, Brasilia, Brazil, September 23-24, 2017 : proceedings (pp. 115-132). (Lecture Notes in Computer Science; Vol. 10669). Springer. https://doi.org/10.1007/978-3-319-73579-5_8
  • Open Access
    Bezhanishvili, N., & Kupke, C. (2016). Games for topological fixpoint logic. Electronic Proceedings in Theoretical Computer Science, 226, 46-60. https://doi.org/10.4204/EPTCS.226.4
  • 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
  • Open Access
    Kupke, C., Kurz, A., & Venema, Y. (2008). Completeness of the finitary Moss logic. In C. Areces, & R. Goldblatt (Eds.), Advances in Modal Logic 7 (pp. 193-217). College Publications. http://www.aiml.net/volumes/volume7/Kupke-Kurz-Venema.pdf
  • Open Access
    Kupke, C., & Venema, Y. (2008). Coalgebraic automata theory: Basic results. Logical Methods in Computer Science, 4(4), Article 10. https://doi.org/10.2168/LMCS-4(4:10)2008
  • Hansen, H. H., Kupke, C., & Pacuit, E. (2007). Bisimulation for Neighbourhood Structures. In T. Mossakowski, U. Montanari, & M. Haveraaen (Eds.), Algebra and Coalgebra in Computer Science: Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007 : proceedings (pp. 279-293). (Lecture Notes in Computer Science; Vol. 4624). Springer. https://doi.org/10.1007/978-3-540-73859-6_19
Page 1 of 2