Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 130
Number of items: 130
  • Open Access
    Kloibhofer, J. (2026). Cycles with annotations: Non-wellfounded proof theory of modal fixpoint logics. [Thesis, fully internal, Universiteit van Amsterdam].
  • 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
    Kloibhofer, J., & Venema, Y. (2025). Interpolation for the two-way modal μ-calculus. In 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science: LICS 2025 : 23-26 June 2025, Singapore : proceedings (pp. 155-168). IEEE Computer Society. https://doi.org/10.1109/LICS65433.2025.00019, https://doi.org/10.48550/arXiv.2505.12899
  • Open Access
    Rooduijn, J. M. W. (2024). Fragments and frame classes: Towards a uniform proof theory for modal fixed point logics. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Menéndez Turata, G. (2024). Cyclic proof systems for modal fixpoint logics. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Bellas Acosta, I., & Venema, Y. (2024). Counting to infinity: Graded modal logic with an infinity diamond. Review of Symbolic Logic, 17(1), 1-35. https://doi.org/10.1017/S1755020322000247
  • Open Access
    Seifan, F. (2024). Coalgebraic fixpoint logic: Expressivity and completeness results. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Dekker, M., Kloibhofer, J., Marti, J., & Venema, Y. (2023). Proof Systems for the Modal μ-Calculus Obtained by Determinizing Automata. In R. Ramanayake, & J. Urban (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods: 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023 : proceedings (pp. 242-259). (Lecture Notes in Computer Science; Vol. 14278), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-031-43513-3_14
  • Open Access
    Rooduijn, J., & Venema, Y. (2023). Focus-Style Proofs for the Two-Way Alternation-Free μ-Calculus. In H. H. Hansen, A. Scedrov, & R. J. G. B. de Queiroz (Eds.), Logic, Language, Information, and Computation: 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11–14, 2023 : proceedings (pp. 318-335). (Lecture Notes in Computer Science; Vol. 13923), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-031-39784-4_20, https://doi.org/10.48550/arXiv.2307.01773
  • 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
Page 1 of 13