@inproceedings{176a55d62fc34109aa6d52942208aae6,
title = "Deduction graphs with universal quantification",
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.",
author = "J.H. Geuvers and I. Loeb",
year = "2008",
doi = "10.1016/j.entcs.2008.03.036",
language = "English",
series = "Electronic Notes in Theoretical Computer Science",
pages = "93--108",
editor = "I. Mackie and D. Plump",
booktitle = "Proceedings 4th International Workshop on Computing with Terms and Graphs (TERMGRAPH 2007, Braga, Portugal, March 31, 2007)",
}