Linear logic and the Hilbert scheme
Mathematical Structures in Computer Science · 2026 · 36
DOI: 10.1017/s0960129526100450 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Structures in Computer Science, online erschienen am 09.03.2026. Verfasst von Daniel Murfet und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Murfet, D., & Troiani, W. A. (2026). Linear logic and the Hilbert scheme. Mathematical Structures in Computer Science, 36. https://doi.org/10.1017/s0960129526100450
Vancouver
Murfet D, Troiani WA. Linear logic and the Hilbert scheme. Mathematical Structures in Computer Science. 2026;36. doi:10.1017/s0960129526100450
BibTeX
@article{Murfet2026,
author = {Murfet, Daniel and Troiani, William Anthony},
title = {Linear logic and the Hilbert scheme},
journal = {Mathematical Structures in Computer Science},
year = {2026},
volume = {36},
doi = {10.1017/s0960129526100450}
}
EUVIMED