Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 5
Number of items: 5
  • Open Access
    Kloibhofer, J. (2026). Cycles with annotations: Non-wellfounded proof theory of modal fixpoint logics. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Kloibhofer, J., Trucco Dalmas, V., & Venema, Y. (2026). Interpolation for Converse PDL. In G. L. Pozzato, & T. Uustalu (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods: 34th International Conference, TABLEAUX 2025, Reykjavik, Iceland, September 27–29, 2025 : proceedings (pp. 258–277). (Lecture Notes in Computer Science; Vol. 15980), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.48550/arXiv.2508.21485, https://doi.org/10.1007/978-3-032-06085-3_14
  • Open Access
    Afshari, B., & Kloibhofer, J. (2025). Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic. Electronic Proceedings in Theoretical Computer Science, 435, 21-40. https://doi.org/10.4204/EPTCS.435.3
  • 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
    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
Page of