Modelling Multiplicative Linear Logic via Deep Inference
Logic
2024-04-03 v1 Logic in Computer Science
Abstract
Multiplicative linear logic is a very well studied formal system, and most such studies are concerned with the one-sided sequent calculus. In this paper we look in detail at existing translations between a deep inference system and the standard sequent calculus one, provide a simplified translation, and provide a formal proof that a standard approach to modelling is indeed invariant to all these translations. En route we establish a necessary condition for provable sequents related to the number of pars and tensors in a formula that seems to be missing from the literature.
Cite
@article{arxiv.2404.01026,
title = {Modelling Multiplicative Linear Logic via Deep Inference},
author = {Tomer Galor and Andrea Schalk},
journal= {arXiv preprint arXiv:2404.01026},
year = {2024}
}