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á bibliografia

Vydané 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:	English
Vydavateľské údaje:	Logical Methods in Computer Science Association 01.02.2020 Logical Methods in Computer Science e.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!