Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 132
Number of items: 132
  • 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
  • Open Access
    Bezhanishvili, N., de Groot, J., & Venema, Y. (2022). Coalgebraic geometric logic: Basic theory. Logical Methods in Computer Science, 18(4), Article 10. https://doi.org/10.46298/LMCS-18(4:10)2022, https://doi.org/10.48550/arXiv.1903.08837
  • 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
  • Open Access
    Carreiro, F., Facchini, A., Venema, Y., & Zanasi, F. (2022). Model theory of monadic predicate logic with the infinity quantifier. Archive for Mathematical Logic, 61(3-4), 465-502. https://doi.org/10.1007/s00153-021-00797-0
  • 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
    Rooduijn, J., & Venema, Y. (2021). Filtration and canonical completeness for continuous modal µ-calculi. Electronic Proceedings in Theoretical Computer Science, 346, 211-226. https://doi.org/10.4204/EPTCS.346.14
  • 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
  • Carreiro, F., Facchini, A., Venema, Y., & Zanasi, F. (2020). The power of the weak. ACM Transactions on Computational Logic, 21(2), Article 15. https://doi.org/10.1145/3372392
  • 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
Page 2 of 14