Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 16
Number of items: 16
  • 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
    Marti, J. (2023). Conditional Logic is Complete for Convexity in the Plane. Review of Symbolic Logic, 16(2), 529-552. https://doi.org/10.1017/S1755020321000356
  • 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
  • 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
  • Open Access
    Kupke, C., Marti, J., & Venema, Y. (2022). Succinct Graph Representations of µ-Calculus Formulas. In F. Manea, & A. Simpson (Eds.), 30th EACSL Annual Conference on Computer Science Logic: CSL 2022, February 14–19, 2022, Göttingen, Germany (Virtual Conference) Article 29 (Leibniz International Proceedings in Informatics; Vol. 216). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2022.29, https://doi.org/10.48550/arXiv.2010.14430
  • Marti, J., & Venema, Y. (2021). A Focus System for the Alternation-Free μ-Calculus. In A. Das, & S. Negri (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods: 30th International Conference, TABLEAUX 2021, Birmingham, UK, September 6–9, 2021 : proceedings (pp. 371-388). (Lecture Notes in Computer Science; Vol. 12842), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-030-86059-2_22
  • Open Access
    Kupke, C., Marti, J., & Venema, Y. (2021). On the size of disjunctive formulas in the µ-calculus. Electronic Proceedings in Theoretical Computer Science, 346, 291-307. https://doi.org/10.4204/EPTCS.346.19
  • 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
  • Hansen, H. H., Kupke, C., Marti, J., & Venema, Y. (2018). Parity Games and Automata for Game Logic. In A. Madeira, & M. Benevides (Eds.), Dynamic Logic. New Trends and Applications: First International Workshop, DALI 2017, Brasilia, Brazil, September 23-24, 2017 : proceedings (pp. 115-132). (Lecture Notes in Computer Science; Vol. 10669). Springer. https://doi.org/10.1007/978-3-319-73579-5_8
  • Open Access
    Marti, J. F. (2016). Interpreting linguistic behavior with possible world models. [Thesis, fully internal, Universiteit van Amsterdam].
Page 1 of 2