Geometry of Interaction for MALL via Hughes-vanGlabbeek Proof-Nets

TL;DR

This paper introduces a novel Geometry of Interaction interpretation for MALL using Hughes-vanGlabbeek proof-nets, capturing correctness criteria through algebraic operators and extending Girard's *-algebra to handle additive features.

Contribution

It provides the first GoI model for MALL based on HvG proof-nets, incorporating algebraic scalar extensions and a refined execution formula to analyze feedback and correctness.

Findings

Termination of the execution formula aligns with HvG's toggling criterion.

The model captures boolean valuations, proof pruning, and additive contractions.

Collapse of boolean structure recovers known multiplicative GoI correspondence.

Abstract

This paper presents, for the first time, a Geometry of Interaction (GoI) interpretation inspired from Hughes-vanGlabbeek (HvG) proof-nets for multiplicative additive linear logic (MALL). Our GoI dynamically captures HvG's geometric correctness criterion-the toggling cycle condition-in terms of algebraic operators. Our new ingredient is a scalar extension of the *-algebra in Girard's *-ring of partial isometries over a boolean polynomial ring with literals of eigenweights as indeterminates. In order to capture feedback arising from cuts, we construct a finer grained execution formula. The expansion of this execution formula is longer than that for collections of slices for multiplicative GoI, hence it is harder to prove termination. Our GoI gives a dynamical, semantical account of boolean valuations (in particular, pruning sub-proofs), conversion of weights (in particular, alpha-conversion), and additive (co)contraction, peculiar to additive proof-theory. Termination of our execution formula is shown to correspond to HvG's toggling criterion. The slice-wise restriction of our execution formula (by collapsing the boolean structure) yields the well known correspondence, explicit or implicit in previous works on multiplicative GoI, between the convergence of execution formulas and acyclicity of proof-nets. Feedback arising from the execution formula by restricting to the boolean polynomial structure yields autonomous definability of eigenweights among cuts from the rest of the eigenweights.