M. Ajtai, Parity and the Pigeonhole Principle, Feasible Mathematics, volume 9 of Progress in Computer Science and Applied Logic, pp.1-24, 1990.
DOI : 10.1007/978-1-4612-3466-1_1

A. Atserias, N. Galesi, and R. Gavaldà, Monotone Proofs of the Pigeon Hole Principle, MLQ, vol.47, issue.4, pp.461-474, 2001.
DOI : 10.1002/1521-3870(200111)47:4<461::AID-MALQ461>3.0.CO;2-B

A. Atserias, N. Galesi, and P. Pudlák, Monotone simulations of nonmonotone proofs, Proceedings 16th Annual IEEE Conference on Computational Complexity, pp.626-638, 2002.
DOI : 10.1109/CCC.2001.933870

P. Beame and T. Pitassi, An exponential separation between the parity principle and the pigeonhole principle, Annals of Pure and Applied Logic, vol.80, issue.3, pp.195-228, 1996.
DOI : 10.1016/0168-0072(96)83747-X

K. Brünnler, Two Restrictions on Contraction, Logic Journal of IGPL, vol.11, issue.5, pp.525-529, 2003.
DOI : 10.1093/jigpal/11.5.525

K. Brünnler, Deep Inference and Symmetry in Classical Proofs, Logos Verlag, 2004.

K. Brünnler and R. Mckinley, An Algorithmic Interpretation of a Deep Inference System, Lecture Notes in Computer SciencePapers, vol.5330, 2008.
DOI : 10.1007/978-3-540-89439-1_34

K. Brünnler and A. F. Tiu, A Local System for Classical Logic, 2001.
DOI : 10.1007/3-540-45653-8_24

P. Bruscoli and A. Guglielmi, On the proof complexity of deep inference, ACM Transactions on Computational Logic, vol.10, issue.2, pp.1-34, 2009.
DOI : 10.1145/1462179.1462186
URL : https://hal.archives-ouvertes.fr/inria-00441211

P. Bruscoli, A. Guglielmi, T. Gundersen, and M. Parigot, A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR- 16), pp.136-153, 2010.
DOI : 10.1007/978-3-642-17511-4_9
URL : https://hal.archives-ouvertes.fr/hal-00529320

S. R. Buss, Abstract, The Journal of Symbolic Logic, vol.22, issue.04, pp.916-927, 1987.
DOI : 10.1016/0304-3975(85)90144-6

A. Das, On the Proof Complexity of Cut-Free Bounded Deep Inference, Lecture Notes in Artificial Intelligence, vol.4, issue.1:9, pp.134-148, 2011.
DOI : 10.2307/2273702

A. Das, Complexity of Deep Inference via Atomic Flows, Computability in Europe, pp.139-150, 2012.
DOI : 10.1007/978-3-642-30870-3_15

E. W. Dijkstra, The undeserved status of the pigeon-hole principle, 1991.

A. Guglielmi, A system of interaction and structure, ACM Transactions on Computational Logic, vol.8, issue.1, pp.1-64, 2007.
DOI : 10.1145/1182613.1182614
URL : https://hal.archives-ouvertes.fr/inria-00441254

A. Guglielmi and T. Gundersen, Normalisation Control in Deep Inference via Atomic Flows, Logical Methods in Computer Science, vol.4, issue.1, pp.1-36, 2008.
DOI : 10.2168/LMCS-4(1:9)2008

A. Guglielmi, T. Gundersen, and M. Parigot, A proof calculus which reduces syntactic bureaucracy, of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum für Informatik, pp.135-150, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00529301

E. Je?ábek, Proof Complexity of the Cut-free Calculus of Structures, Journal of Logic and Computation, vol.19, issue.2, pp.323-339, 2009.
DOI : 10.1093/logcom/exn054

E. Je?ábek, A sorting network in bounded arithmetic, Annals of Pure and Applied Logic, vol.162, issue.4, pp.341-355, 2011.
DOI : 10.1016/j.apal.2010.10.002

E. Je?ábek, Proofs with monotone cuts, Mathematical Logic Quarterly, vol.5, issue.3, pp.177-187, 2012.
DOI : 10.1002/malq.201020071

J. Krají?ek, P. Pudlák, and A. Woods, An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle, Random Structures and Algorithms, vol.3, issue.1, pp.15-39, 1995.
DOI : 10.1002/rsa.3240070103

J. Paris and A. Wilkie, ? 0 sets and induction. Open Days in Model Theory and Set Theory, pp.237-248, 1981.

T. Pitassi, P. Beame, and R. Impagliazzo, Exponential lower bounds for the pigeonhole principle, Computational Complexity, vol.34, issue.2, pp.97-140, 1993.
DOI : 10.1007/BF01200117

A. Razborov, Proof Complexity of Pigeonhole Principles, Developments in Language Theory, pp.203-206, 2002.
DOI : 10.1007/3-540-46011-X_8

L. Straßburger, Extension without cut, Annals of Pure and Applied Logic, vol.163, issue.12, 1995.
DOI : 10.1016/j.apal.2012.07.004