References

1. Sandra Alves, Maribel Fernández & Ian Mackie (2011): A new graphical calculus of proofs. In: Rachid Echahed: Proceedings of TERMGRAPH 2011, EPTCS 48, pp. 69–84, doi:10.4204/EPTCS.48.8.
2. Maria Luisa Bonet & Samuel R. Buss (1993): The Deduction Rule and Linear and Near-Linear Proof Simulations. Journal of Symbolic Logic 58(2), pp. 688–709, doi:10.2307/2275228.
3. Vaston Gonçalves da Costa (2007): Compactação de Provas Lógicas. Departamento de Informática, PUC–Rio. Available at http://www.maxwell.lambda.ele.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10018@2.
4. M. Finger (2005): DAG Sequent Proofs with a Substitution Rule. In: We will show Them – Essays in honour of Dov Gabbay 60th birthday, Kings College Publications 1. Kings College, London, pp. 671–686. Available at http://www.ime.usp.br/~mfinger/home/papers/FW04.pdf.
5. Herman Geuvers & Iris Loeb (2007): Natural Deduction via Graphs: Formal Definition and Computation Rules. Mathematical. Structures in Comp. Sci. 17(3), pp. 485–526, doi:10.1017/S0960129507006123.
6. J.-Y. Girard, Y. Lafont & L. Regnier (1995): Advances in Linear Logic. Cambridge University Press, doi:10.1017/CBO9780511629150. Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993.
7. Jean yves Girard (1996): Proof-nets: The parallel syntax for proof-theory. In: Logic and Algebra. Dekker, pp. 97–124. Available at iml.univ-mrs.fr/~girard/Proofnets.ps.gz.
8. L. Gordeev, E. H. Haeusler & V. G. Costa (2009): Proof compressions with circuit-structured substitutions. Journal of Mathematical Sciences 158(5), pp. 645–658, doi:10.1007/s10958-009-9405-3.
9. E.H. Haeusler (2013): A proof-theoretical discussion on the mechanization of propositional logics. Electronic Proceedings in Theoretical Computer Science Vol. 113, pp. 7-8, doi:10.4204/EPTCS.113. Available at http://rvg.web.cse.unsw.edu.au/eptcs/content.cgi?LSFA2012#EPTCS113.3.
10. Anjolina Grisi Oliveira & Ruy J.G.B. Queiroz (2003): Geometry of Deduction Via Graphs of Proofs. In: Ruy J.G.B. Queiroz: Logic for Concurrency and Synchronisation, Trends in Logic 15. Springer Netherlands, pp. 3–88, doi:10.1007/0-306-48088-3_1.
11. R. Statman (1979): Intuitionistic Propositional Logic is Polynomial-Space Complete. Theoretical Computer Science 9, pp. 67–72, doi:10.1016/0304-3975(79)90006-9. Available at http://www.sciencedirect.com/science/article/pii/0304397579900069.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org