Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657781 | Theoretical Computer Science | 2005 | 30 Pages |
Abstract
We present a notion of sliced proof-nets for the polarized fragment of Linear Logic and a corresponding game model. We show that the connection between them is very strong through an equivalence of categories (this contains soundness, full completeness and faithful completeness).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Olivier Laurent,