Affiliation:
1. Scuola Normale Superiore di Pisa
2. Dipartimento di Studi letterari, filosofici e di Storia dell’arte , Università di Roma “Tor Vergata”
Abstract
AbstractSequent-style refutation calculi with non-invertible rules are challenging to design because multiple proof-search strategies need to be simultaneously verified. In this paper, we present a refutation calculus for the multiplicative–additive fragment of linear logic ($\textsf{MALL}$) whose binary rule for the multiplicative conjunction $(\otimes )$ and the unary rule for the additive disjunction $(\oplus )$ fail invertibility. Specifically, we design a cut-free hypersequent calculus $\textsf{HMALL}$, which is equivalent to $\textsf{MALL}$, and obtained by transforming the usual tree-like shape of derivations into a parallel and linear structure. Next, we develop a refutation calculus $\overline{\textsf{HMALL}}$ based on the calculus $\textsf{HMALL}$. As far as we know, this is also the first refutation calculus for a substructural logic. Finally, we offer a fractional semantics for $\textsf{MALL}$—whereby its formulas are interpreted by a rational number in the closed interval [0, 1] —thus extending to the substructural landscape the project of fractional semantics already pursued for classical and modal logics.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference23 articles.
1. Logic programming with focusing proofs in linear logic;Andreoli;Journal of Logic and Computation,1992
2. Hypersequents, logical consequence and intermediate logics for concurrency;Avron;Annals of Mathematics and Artificial Intelligence,1991
3. The method of hypersequents in the proof theory of propositional non-classical logics;Avron,1996
4. Cut-elimination and deductive polarization in complementary classical logic;Carnielli;Logic Journal of the IGPL,2017