Proof Nets for PiL (Full Version)
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909042056626176 |
|---|---|
| author | Acclavio, Matteo Manara, Giulia |
| author_facet | Acclavio, Matteo Manara, Giulia |
| contents | We introduce proof nets for PiL, an extension of first-order multiplicative additive linear logic with new operators allowing a shallow encoding of processes in the π-calculus as formulas. We provide correctness criterion, sequentialization procedure, and a proof translation algorithm. We show that proof nets provide a canonical representation of sequent calculus derivations modulo rule permutations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_14476 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Proof Nets for PiL (Full Version) Acclavio, Matteo Manara, Giulia Logic in Computer Science We introduce proof nets for PiL, an extension of first-order multiplicative additive linear logic with new operators allowing a shallow encoding of processes in the π-calculus as formulas. We provide correctness criterion, sequentialization procedure, and a proof translation algorithm. We show that proof nets provide a canonical representation of sequent calculus derivations modulo rule permutations. |
| title | Proof Nets for PiL (Full Version) |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2605.14476 |