Hostname: page-component-89b8bd64d-j4x9h Total loading time: 0 Render date: 2026-05-07T02:33:43.906Z Has data issue: false hasContentIssue false

Linear logic and the Hilbert scheme

Published online by Cambridge University Press:  09 March 2026

Daniel Murfet
Affiliation:
Mathematics and Statistics, University of Melbourne Institute, Australia
William Anthony Troiani*
Affiliation:
School of Mathematics and Statistics, University of Melbourne School of Mathematics and Statistics , Australia
*
Corresponding author: William Anthony Troiani; Email: william.a.troiani@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

We introduce a geometric model of shallow multiplicative exponential linear logic (MELL) using the Hilbert scheme. Building on previous work interpreting multiplicative linear logic (MLL) proofs as systems of linear equations, we show that shallow MELL proofs can be modelled by locally projective schemes. The key insight is that while MLL proofs correspond to equations between formulas, the exponential fragment of shallow proofs corresponds to equations between these equations. We prove that the model is invariant under cut-elimination by constructing explicit isomorphisms between the schemes associated with proofs related by cut-reduction steps. A key technical tool is the interpretation of the exponential modality using the Hilbert scheme, which parameterises closed subschemes of projective space. We demonstrate the model through detailed examples, including an analysis of Church numerals that reveals how the Hilbert scheme captures the geometric content of promoted formulas. This work establishes new connections between proof theory and algebraic geometry, suggesting broader relationships between computation and scheme theory.

Information

Type
Special Issue: Phil Scott memorial issue
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2026. Published by Cambridge University Press