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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference33 articles.
1. Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
2. Tubella A.A. (2016). A study of normalisation through subatomic logic. PhD thesis, University of Bath.
3. Retoré C. (1993). Réseaux et Séquents Ordonnés. PhD thesis, Université Paris VII.
4. A compact representation of proofs
5. On Herbrand’s Theorem for Intuitionistic Logic
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Combinatorial Flows as Bicolored Atomic Flows;Logic, Language, Information, and Computation;2022
2. Combinatorial Proofs and Decomposition Theorems for First-order Logic;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29