Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix
This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect matching. By applying matching theory, we obtain new...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Logical Methods in Computer Science e.V.
2020-02-01
|
| سلاسل: | Logical Methods in Computer Science |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://lmcs.episciences.org/5134/pdf |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|