Skip to Main content Skip to Navigation
Journal articles

Deep inference and expansion trees for second-order multiplicative linear logic

Lutz Straßburger 1, 2
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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.
Complete list of metadatas

https://hal.inria.fr/hal-01942410
Contributor : Lutz Straßburger <>
Submitted on : Monday, December 3, 2018 - 11:08:55 AM
Last modification on : Thursday, March 5, 2020 - 7:07:16 PM
Document(s) archivé(s) le : Monday, March 4, 2019 - 1:28:18 PM

File

ExpTreesLL.pdf
Files produced by the author(s)

Identifiers

Citation

Lutz Straßburger. Deep inference and expansion trees for second-order multiplicative linear logic. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2019, Special Issue 8 (A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday), 29, pp.1030-1060. ⟨10.1017/S0960129518000385⟩. ⟨hal-01942410⟩

Share

Metrics

Record views

121

Files downloads

244