Indexed metadata
Elimination and cut-elimination in multiplicative linear logic
Daniel Murfet, William Troiani
Source record
Source: Crossref
Published: Jan 1, 2026
DOI: 10.1017/s0960129525000143
Open original source ↗Source abstract
Abstract We associate with every proof structure in multiplicative linear logic an ideal that represents the logical content of the proof as polynomial equations. We show how cut-elimination in multiplicative proof nets corresponds to instances of the Buchberger algorithm for computing Gröbner bases in elimination theory.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.