An Abstract Completion Procedure for Cut Elimination in Deduction Modulo Guillaume Burel École Normale Supérieure de Lyon - Schrödinger - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-01-06 05:11:00 Cut-elimination theorem Sequent Rule of inference First-order logic Formal proof Natural deduction Structural proof theory Logic Proof theory Mathematical logic		An Abstract Completion Procedure for Cut Elimination in Deduction Modulo Guillaume Burel École Normale Supérieure de Lyon & LORIA∗ The complementarity and interaction between computation Add to Reading List Source URL: www.ensiie.fr Download Document from Source Website File Size: 75,60 KB Share Document on Facebook

	Logical Methods in Computer Science Vol. 11(3:7)2015, pp. 1–33 www.lmcs-online.org Submitted May 17, 2014 Published Sep. 3, 2015 DocID: 1regS - View Document
	Some Notes on Proofs with Alpha Graphs Frithjof Dau Technische Universit¨ at Dresden, Dresden, Germany DocID: 1r1sv - View Document
	From Deep Inference to Proof Nets via Cut Elimination Lutz Straßburger INRIA Saclay–ˆIle-de-France, France http://www.lix.polytechnique.fr/∼ lutz June 24, 2009 DocID: 1qJXe - View Document
	The Focused Calculus of Structures Kaustuv Chaudhuri, Nicolas Guenot, and Lutz Straßburger INRIA & LIX/École Polytechnique Route de Saclay, 91128 Palaiseau, France {kaustuv,nguenot,lutz}@lix.polytechnique.fr DocID: 1qvQb - View Document
	Focused and Synthetic Nested Sequents Kaustuv Chaudhuri, Sonia Marin, and Lutz Straßburger ´ Inria & LIX/Ecole polytechnique, France {kaustuv.chaudhuri,sonia.marin,lutz.strassburger}@inria.fr DocID: 1pwE3 - View Document