Natural deduction via graphs : formal definition and computation rules

J.H. Geuvers, I. Loeb

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)

Abstract

In this paper, we introduce the formalism of deduction graphs as a generalisation of both Gentzen–Prawitz style natural deduction and Fitch style flag deduction. The advantage of this formalism is that, as with flag deductions (but not natural deduction), subproofs can be shared, but the linearisation used in flag deductions is avoided. Our deduction graphs have both nodes and boxes, which are collections of nodes that also form a node themselves. This is reminiscent of the bigraphs of Milner, where the link graph describes the nodes and edges and the place graph describes the nesting of nodes. We give a precise definition of deduction graphs, together with some illustrative examples. Furthermore, we analyse their computational behaviour by studying the process of cut-elimination and by defining translations from deduction graphs to simply typed lambda terms. From a slight variation of this translation, we conclude that the process of cut-elimination is strongly normalising. The translation to simple type theory removes quite a lot of structure, so we also propose a translation to a context calculus with lets that faithfully captures the structure of deduction graphs. The proof nets of linear logic also offer a graph-like presentation of natural deduction, and we point out some similarities between the two formalisms.
Original languageEnglish
Pages (from-to)485-526
JournalMathematical Structures in Computer Science
Volume17
Issue number3
DOIs
Publication statusPublished - 2007

Fingerprint Dive into the research topics of 'Natural deduction via graphs : formal definition and computation rules'. Together they form a unique fingerprint.

Cite this