Kupke, C., Kurz, A., Pattinson, D. (2005) Ultrafilter extensions for coalgebras.

In Fiadeiro, J.L. Harman, N. Roggenbach, M. Rutten, J. (Eds.), Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings (pp 263-277) (Lecture Notes in Computer Science, Vol. 3629). Springer.

Kupke, C., Kurz, A., Venema, Y. (2003) Stone coalgebras.

Technical Reports. Institute for Logic, Language and Computation.

Working paper | UvA-DARE

Kupke, C., Kurz, A., Venema, Y. (2004) Stone Coalgebras.

Theoretical Computer Science, Vol. 327 (pp 109-134)

Article | https://doi.org/10.1016/j.tcs.2004.07.023 | UvA-DARE

Kupke, C., Kurz, A., Venema, Y. (2008) Completeness of the finitary Moss logic.

In Areces, C. Goldblatt, R. (Eds.), Advances in Modal Logic 7 (pp 193-217). College Publications.

Kupke, C., Kurz, A., Venema, Y. (2012) Completeness for the coalgebraic cover modality.

Logical Methods in Computer Science, Vol. 8

Article | https://doi.org/10.2168/LMCS-8(3:2)2012 | UvA-DARE

Kupke, C., Marti, J., Venema, Y. (2021) On the size of disjunctive formulas in the µ-calculus.

Electronic Proceedings in Theoretical Computer Science, Vol. 346 (pp 291-307)

Article | https://doi.org/10.4204/EPTCS.346.19 | UvA-DARE

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. The Association for Computing Machinery.

Kupke, C., Marti, J., Venema, Y. (2022) Succinct Graph Representations of µ-Calculus Formulas.

In Manea, F. Simpson, A. (Eds.), 30th EACSL Annual Conference on Computer Science Logic: CSL 2022, February 14–19, 2022, Göttingen, Germany (Virtual Conference) (Leibniz International Proceedings in Informatics, Vol. 216). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Kupke, C., Venema, Y. (2005) Closure properties of coalgebra automata.

In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05) (pp 199-208). IEEE Press.

Kupke, C., Venema, Y. (2008) Coalgebraic automata theory: Basic results.

Logical Methods in Computer Science, Vol. 4

Article | https://doi.org/10.2168/LMCS-4(4:10)2008 | UvA-DARE

Kupke, C. (2006) Finitary coalgebraic logics.

Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Kurtonina, N., de Rijke, M. (1997) Classifying description logics.

In Rousset, M.-C. (Eds.), Proc. International Workshop on Description Logics (DL'97) (pp 49-53)

Kurtonina, N., de Rijke, M. (1997) Simulating without negation.

Journal of Logic and Computation, Vol. 7 (pp 503-524)

Article | UvA-DARE

Kurtonina, N., de Rijke, M. (1997) Expressiveness of first-order description logics.

Research Report. University of Warwick.

Report | UvA-DARE

Kurtonina, N., de Rijke, M. (1997) Bisimulations for temporal logic.

Journal of Logic, Language and Information, Vol. 6 (pp 403-425)

Article | UvA-DARE

Kurtonina, N., de Rijke, M. (1999) Expressiveness of concept expressions in first-order description logics.

Artificial Intelligence, Vol. 107 (pp 303-333)

Article | https://doi.org/10.1016/S0004-3702(98)00109-X | UvA-DARE

Kurtonina, N. (1995) Making database explicit in categorial grammar.

Bulletin of the IGPL, Vol. 1 (pp 68-73)

Article | UvA-DARE

Kurtonina, N. (1995) Frames and Labels. A modal analysis of categorial inference.

Technical Report. onbekend (FdL).

Report | UvA-DARE

Kurtonina, N. (1995) Frames and Labels.

Thesis, fully external | UvA-DARE

Kurz, A., Kupke, C., Venema, Y. (2003) Stone coalgebras.

Electronic Notes in Theoretical Computer Science, Vol. 82

Article | UvA-DARE