Photo by sarahdorweiler from unsplash
In this paper, we introduce the notion of expansion tree for linear logic. As in Miller's original work, we have a shallow reading of an expansion tree that corresponds to… Click to show full abstract
In this paper, we introduce the notion of expansion tree for linear logic. As in Miller's original work, we have a shallow reading of an expansion tree that corresponds to the conclusion of the proof, and a deep reading which is a formula that can be proved by propositional rules. We focus our attention to MLL2, and we also present a deep inference system for that logic. This allows us to give a syntactic proof to a version of Herbrand's theorem.
Keywords:
deep inference;
expansion;
expansion trees;
linear logic;
inference expansion
Journal Title: Mathematical Structures in Computer Science
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematical Structures in Computer Science
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!