Abstract
Deduction graphs [3] provide a formalism for natural deduction, where the deductions have the structure of acyclic directed graphs with boxes. The boxes are used to restrict the scope of local assumptions. Proof nets for multiplicative exponential linear logic (MELL) are also graphs with boxes, but in MELL the boxes have the purpose of controlling the modal operator !. In this paper we study the apparent correspondences between deduction graphs and proof nets, both by looking at the structure of the proofs themselves and at the process of cut-elimination defined on them. We give two translations from deduction graphs for minimal proposition logic to proof nets: a direct one, and a mapping via so-called context nets. Context nets are closer to natural deduction than proof nets, as they have both premises (on top of the net) and conclusions (at the bottom). Although the two translations give basically the same results, the translation via context nets provides a more abstract view and has the advantage that it follows the same inductive construction as the deduction graphs. The translations behave nicely with respect to cut-elimination.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Danos, V., Regnier, L.: The structure of the multiplicatives. Archive for Mathematical logic 28 (1989)
David, R., Kesner, D.: An arithmetical strong-normalisation proof for reduction modulo in proof-nets, draft
Geuvers, H., Loeb, I.: Natural Deduction via Graphs: Formal Definition and Computation Rules. In: MSCS (to appear), http://www.cs.ru.nl/~herman/PUBS/gd.pdf
Girard, J.-Y.: Linear Logic. Theoretical Computer Science 50(1), 1–101 (1987)
Puite, Q.: Proof Nets with Explicit Negation for Multiplicative Linear Logic, Preprint 1079, Department of Mathematics, Utrecht University (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geuvers, H., Loeb, I. (2006). From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions. In: Královič, R., Urzyczyn, P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821069_4
Download citation
DOI: https://doi.org/10.1007/11821069_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37791-7
Online ISBN: 978-3-540-37793-1
eBook Packages: Computer ScienceComputer Science (R0)