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...
Gardado en:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Logical Methods in Computer Science e.V.
2006-10-01
|
| Series: | Logical Methods in Computer Science |
| Assuntos: | |
| Acceso en liña: | https://lmcs.episciences.org/2239/pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|