Deduction Graphs with Universal Quantification

Authors:
Herman Geuvers;Iris Loeb
Affiliations:
Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands;Department of Mathematics and Statistics, University of Canterbury, New Zealand
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 3
Cited 1

Linear logic

Theoretical Computer Science
Natural deduction via graphs: formal definition and computation rules

Mathematical Structures in Computer Science
From deduction graphs to proof nets: boxes and sharing in the graphical presentation of deductions

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

A sequent calculus with implicit term representation

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic

Quantified Score

Hi-index	0.01

Visualization

Abstract

Deduction Graphs are meant to generalise both Gentzen-Prawitz style natural deductions and Fitch style flag deductions. They have the structure of acyclic directed graphs with boxes. In [Herman Geuvers and Iris Loeb. Natural Deduction via Graphs: Formal Definition and Computation Rules. Mathematical Structures in Computer Science (Special Issue on Theory and Applications of Term Graph Rewriting), Volume 17(03):485-526, 2007.] we have investigated the deduction graphs for minimal proposition logic. This paper studies the extension with first-order universal quantification, showing the robustness of the concept of deduction graphs.