Deep Inference

[1]  R. Statman.  Bounds for proof-search and speed-up in the predicate calculus , 1978 .

[2]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[3]  Lutz Straßburger,et al.  Non-commutativity and MELL in the Calculus of Structures , 2001, CSL.

[4]  Alwen Tiu,et al.  A Local System for Classical Logic , 2001, LPAR.

[5]  Paola Bruscoli.  A Purely Logical Account of Sequentiality in Proof Search , 2002, ICLP.

[6]  H. Reichel,et al.  Deep Inference and Symmetry in Classical Proofs , 2003 .

[7]  Lutz Straßburger,et al.  Linear logic and noncommutativity in the calculus of structures , 2003 .

[8]  Rüdger Thiele,et al.  Hilbert's Twenty-Fourth Problem , 2002, Journal of Automated Reasoning.

[9]  Ozan Kahramanogullari.  Towards Planning as Concurrency , 2005, Artificial Intelligence and Applications.

[10]  Alwen Tiu,et al.  A System of Interaction and Structure II: The Need for Deep Inference , 2005, Log. Methods Comput. Sci..

[11]  Kai Brünnler.  Cut Elimination inside a Deep Inference System for Classical Predicate Logic , 2006, Stud Logica.

[12]  Alessio Guglielmi,et al.  A system of interaction and structure , 1999, TOCL.

[13]  Ozan Kahramanoğulları.  Interaction and Depth against Nondeterminism in Deep Inference Proof Search , 2007 .

[14]  Ozan Kahramanogullari.  On Linear Logic Planning and Concurrency , 2008, LATA.

[15]  Tom Gundersen,et al.  Normalisation Control in Deep Inference via Atomic Flows , 2007, Log. Methods Comput. Sci..

[16]  Ozan Kahramanogullari.  On linear logic planning and concurrency , 2009, Inf. Comput..

[17]  Nachum Dershowitz,et al.  When are Two Algorithms the Same? , 2008, The Bulletin of Symbolic Logic.

[18]  Alessio Guglielmi,et al.  On the proof complexity of deep inference , 2009, TOCL.

[19]  Tom Gundersen.  A General View of Normalisation through Atomic Flows , 2009 .

[20]  Kai Brunnler,et al.  Nested Sequents , 2010, ArXiv.

[21]  Tom Gundersen,et al.  A Proof Calculus Which Reduces Syntactic Bureaucracy , 2010, RTA.

[22]  Lutz Straßburger,et al.  Breaking Paths in Atomic Flows for Classical Logic , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[23]  Tom Gundersen,et al.  A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae , 2010, LPAR.

[24]  Luca Roversi.  Linear Lambda Calculus and Deep Inference , 2011, TLCA.

[25]  Anupam Das,et al.  On the Proof Complexity of Cut-Free Bounded Deep Inference , 2011, TABLEAUX.

[26]  Lutz Straßburger,et al.  From Deep Inference to Proof Nets via Cut Elimination , 2011, J. Log. Comput..

[27]  Tom Gundersen,et al.  Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[28]  Tom Gundersen,et al.  A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus , 2013, LPAR.

[29]  Lutz Straßburger,et al.  A Logical Basis for Quantum Evolution and Entanglement , 2014, Categories and Types in Logic, Language, and Physics.

[30]  Ozan Kahramanogullari.  Interaction and Depth against Nondeterminism in Proof Search , 2014, Log. Methods Comput. Sci..

[31]  Luca Roversi.  A deep inference system with a self-dual binder which is complete for linear lambda calculus , 2016, J. Log. Comput..