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...

Celý popis

Podrobná bibliografie

Vydáno v:	Logical methods in computer science Ročník 16, Issue 1; číslo 1
Hlavní autor:	Nguyên, Lê Thành Dũng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 01.02.2020 Logical Methods in Computer Science e.V
Témata:	03f52, 68r10 Computer Science computer science - logic in computer science Discrete Mathematics f.4.1 g.2.2 Logic in Computer Science Proof nets Perfect matching
ISSN:	1860-5974, 1860-5974
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!