From Proof Nets to the Free *-Autonomous Category
In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set of axiom links but a tree in which the axiom links are subt...
Sparad:
| Huvudupphov: | , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Logical Methods in Computer Science e.V.
2006-10-01
|
| Serie: | Logical Methods in Computer Science |
| Ämnen: | |
| Länkar: | https://lmcs.episciences.org/2239/pdf |
| Taggar: |
Inga taggar, Lägg till första taggen!
|