Core Concepts
Every proof in the deep inference system MAV can be normalized to a cut-free proof using a semantic model construction.
Abstract
The content presents a semantic proof of the admissibility of the cut rule and other "non-analytic" rules in the deep inference system MAV, which extends the basic system BV with additives.
Key highlights:
MAV is a deep inference system that extends linear logic with a self-dual non-commutative connective capturing sequential composition.
Existing proofs of cut elimination for deep inference systems like MAV rely on intricate syntactic reasoning and complex termination measures.
The authors develop an algebraic semantics for MAV, called MAV-algebras, and a weaker notion of MAV-frames.
They show that every MAV-frame can be completed to an MAV-algebra, and that the MAV-frame constructed from normal proofs is strongly complete for MAV.
This allows them to prove that every MAV-provable structure has a normal proof, avoiding the use of the cut rule and other "non-analytic" rules.
The proofs are constructive and have been mechanized in the Agda proof assistant.