Efficient and Natural Proof Systems

Project: Research council

  • 5 Chapter in a published conference proceeding
  • 4 Article
  • 1 Chapter or section
  • 1 Paper
Filter
Chapter in a published conference proceeding

Search results

  • 2018

    A fully abstract game semantics for countable nondeterminism

    Gowers, W. J. & Laird, J. D., 1 Aug 2018, Computer Science Logic 2018, CSL 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 119. 24

    Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    1 Citation (SciVal)

  • A Natural Proof System for Herbrand's Theorem

    Ralph, B., 2018, Logical Foundations of Computer Science - International Symposium, LFCS 2018, Proceedings. Nerode, A. & Artemov, S. (eds.). Springer, p. 289-308 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10703).

    Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    2 Citations (SciVal)
  • 2017

    On the Length of Medial-Switch-Mix Derivations

    Bruscoli, P. & Strassburger, L., Jun 2017, Logic, Language and Computation: 24th International Workshop, WoLLIC 2017, London, UK, July 18–21, 2017: Proceedings. Kennedy, J. & de Queiroz, R. J. G. B. (eds.). Berlin, Germany: Springer Verlag, p. 68-79 (Lecture Notes in Computer Science; vol. 10388).

    Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    File
    3 Citations (SciVal)
    237 Downloads (Pure)
  • 2016

    Conflict nets: efficient locally canonical MALL proof nets

    Hughes, D. & Heijltjes, W., 2 Jul 2016, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2016. New York, U. S. A.: Association for Computing Machinery, p. 437-446 10 p. (Proceedings - Symposium on Logic in Computer Science).

    Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    Open Access
    File
    8 Citations (SciVal)
    212 Downloads (Pure)
  • 2015

    Complexity bounds for sum-product logic via additive proof nets and Petri nets

    Heijltjes, W. & Hughes, D., 10 Jul 2015, Proceedings of the 30th ACM/IEEE Symposium on Logic in Computer Science (LICS), 2015. IEEE, p. 80-91 12 p. (2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science).

    Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

    File
    5 Citations (SciVal)
    200 Downloads (Pure)