Linear Realisability over nets: multiplicatives (extended version)
Résumé
We provide a new realisability model based on orthogonality for the multiplicative fragment of linear logic, both in presence of generalised axioms (MLL ✠ ) and in the standard case (MLL). The novelty is the definition of cut elimination for generalised axioms. We prove that our model is adequate and complete both for MLL ✠ and MLL.
Domaines
Informatique [cs]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|