Linear Realisability over nets: multiplicatives (long version)
Logic in Computer Science
2024-11-27 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2411.17486,
title = {Linear Realisability over nets: multiplicatives (long version)},
author = {Adrien Ragot and Thomas Seiller and Lorenzo Tortora de Falco},
journal= {arXiv preprint arXiv:2411.17486},
year = {2024}
}