Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 18
Number of items: 18
  • Open Access
    Afshari, B., Enqvist, S., Leigh, G. E., Marti, J., & Venema, Y. (2025). Proof Systems for two-Way Modal μ-Calculus. Journal of Symbolic Logic, 90(3), 1211-1260. https://doi.org/10.1017/jsl.2023.60
  • Open Access
    Afshari, B., Enqvist, S., & Leigh, G. E. (2024). Cyclic proofs for the first-order μ-calculus. Logic Journal of the IGPL, 32(1), 1–34. https://doi.org/10.1093/jigpal/jzac053
  • Open Access
    Seifan, F. (2024). Coalgebraic fixpoint logic: Expressivity and completeness results. [Thesis, fully internal, Universiteit van Amsterdam].
  • Bezhanishvili, N., Enqvist, S., & de Groot, J. (2020). Duality for instantial neighbourhood logic via coalgebra. In D. Petrişan, & J. Rot (Eds.), Coalgebraic Methods in Computer Science: 15th IFIP WG 1.3 International Workshop, CMCS 2020, colocated with ETAPS 2020, Dublin, Ireland, April 25–26, 2020 : proceedings (pp. 32-54). ( Lecture Notes in Computer Science; Vol. 12094). Springer. https://doi.org/10.1007/978-3-030-57201-3_3
  • Enqvist, S., Seifan, F., & Venema, Y. (2019). Completeness for μ-calculi: A coalgebraic approach. Annals of Pure and Applied Logic, 170(5), 578-641. https://doi.org/10.1016/j.apal.2018.12.004
  • 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
  • Open Access
    van Benthem, J., Bezhanishvili, N., & Enqvist, S. (2019). A new game equivalence, its logic and algebra. Journal of Philosophical Logic, 48(4), 649-684. https://doi.org/10.1007/s10992-018-9489-7
  • Open Access
    van Benthem, J., Bezhanishvili, N., & Enqvist, S. (2019). A propositional dynamic logic for instantial neighbourhood semantics. Studia Logica, 107(4), 719-751. https://doi.org/10.1007/s11225-018-9825-5
  • Open Access
    Enqvist, S., & Venema, Y. (2019). Disjunctive bases: normal forms and model theory for modal logics. Logical Methods in Computer Science, 15(1), Article 30. https://doi.org/10.23638/LMCS-15(1:30)2019
  • Enqvist, S., Seifan, F., & Venema, Y. (2018). Completeness for the modal μ-calculus: Separating the combinatorics from the dynamics. Theoretical Computer Science, 727, 37-100. https://doi.org/10.1016/j.tcs.2018.03.001
Page 1 of 2