Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 13
Number of items: 13
  • Open Access
    Afshari, B., & Grotenhuis, L. (2026). Intuitionistic μ-Calculus with the Lewis Arrow. 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. 374-392). (Lecture Notes in Computer Science; Vol. 15980), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-032-06085-3_20
  • 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., & 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
    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
    Menéndez Turata, G. (2024). Cyclic proof systems for modal fixpoint logics. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Afshari, B., Leigh, G. E., & Menéndez Turata, G. (2023). A Cyclic Proof System for Full Computation Tree Logic. In B. Klin, & E. Pimentel (Eds.), 31st EACSL Annual Conference on Computer Science Logic: CSL 2023, February 13-16, 2023, Warsaw, Poland Article 5 (Leibniz International Proceedings in Informatics; Vol. 252). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2023.5
  • Open Access
    Afshari, B., & Wehr, D. (2023). Exact bounds for acyclic higher-order recursion schemes. Information and Computation, 290, Article 104982. https://doi.org/10.1016/j.ic.2022.104982
  • Afshari, B., & Wehr, D. (2022). Abstract Cyclic Proofs. In A. Ciabattoni, E. Pimentel, & R. J. G. B. de Queiroz (Eds.), Logic, Language, Information, and Computation: 28th International Workshop, WoLLIC 2022, Iași, Romania, September 20–23, 2022 : proceedings (pp. 309–325). (Lecture Notes in Computer Science; Vol. 13468), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-031-15298-6_20
  • Open Access
    Afshari, B., & Leigh, G. E. (2022). Lyndon interpolation for modal μ-calculus. In A. Özgün, & Y. Zinova (Eds.), Language, Logic, and Computation: 13th International Tbilisi Symposium, TbiLLC 2019, Batumi, Georgia, September 16-20, 2019 : revised selected papers (pp. 197–213). (Lecture Notes in Computer Science; Vol. 13206), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-030-98479-3_10
Page 1 of 2