D. Aerts, Quantum Mechanics: Structures, Axioms and Paradoxes, Quantum Mechanics and the Nature of Reality, pp.141-205, 1999.
DOI : 10.1007/978-94-017-2834-8_6
URL : http://arxiv.org/abs/quant-ph/0106132

H. Andréka, J. X. Madarász, I. Németi, and G. Székely, Axiomatizing Relativistic Dynamics without Conservation Postulates, Studia Logica, vol.7, issue.5, pp.163-186, 2008.
DOI : 10.1007/s11225-008-9125-6

M. Baaz, S. Hetzl, A. Leitsch, C. Richter, and H. Spohr, Cut-Elimination: Experiments with CERES, Logic for Programming, pp.481-495, 2004.
DOI : 10.1007/978-3-540-32275-7_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.8096

M. Baaz and A. Leitsch, Towards a clausal analysis of cut-elimination, Journal of Symbolic Computation, vol.41, issue.3-4, pp.381-410, 2006.
DOI : 10.1016/j.jsc.2003.10.005

M. Baaz and R. Zach, Algorithmic structuring of cut-free proofs, CSL '92: Selected Papers from the Workshop on Computer Science Logic, pp.29-42, 1993.
DOI : 10.1007/3-540-56992-8_4

P. Brauner, C. Houtmann, and C. Kirchner, Principles of Superdeduction, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.
DOI : 10.1109/LICS.2007.37
URL : https://hal.archives-ouvertes.fr/inria-00133557

G. Chaitin, The intelligibility of the universe and the notions of simplicity, complexity and irreducibility, 2002.

G. Dowek, T. Hardin, and C. Kirchner, Theorem proving modulo, Institut National de Recherche en Informatique et en Automatique, 1998.
URL : https://hal.archives-ouvertes.fr/hal-01199506

M. Finger and D. M. Gabbay, Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs, Logic Journal of IGPL, vol.15, issue.5-6, pp.5-6553, 2007.
DOI : 10.1093/jigpal/jzm040

G. Gentzen, Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210405
DOI : 10.1007/BF01201353

J. Herbrand, Recherches sur la Theorie de la Demonstration, 1930.

S. Hetzl, Proof Fragments, Cut-Elimination and Cut-Introduction

S. Hetzl, A. Leitsch, D. Weller, and B. W. Paleo, Herbrand Sequent Extraction, Proceedings of the Conferences on Intelligent Computer Mathematics, number 5144 in LNAI, 2008.
DOI : 10.1007/978-3-540-85110-3_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.9347

D. Miller and V. Nigam, Incorporating Tables into Proofs, CSL 2007: Computer Science Logic, pp.466-480, 2007.
DOI : 10.1007/978-3-540-74915-8_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.3026

P. Bruno-woltzenlogel, Herbrand Sequent Extraction, 2008.

P. Pudlak, The Length of Proofs, chapter The Length of Proofs, pp.548-637, 1998.

S. Adonai and . Sant-'anna, An axiomatic framework for classical particle mechanics without space-time, p.0

E. Shapiro and L. Sterling, The Art of Prolog: Advanced Programming Techniques, 1994.

F. Suppe, The Structure of Scientific Theories., Systematic Zoology, vol.27, issue.3, 1977.
DOI : 10.2307/2412897

P. Suppes, What is a scientific theory? Philosophy of Science Today, pp.55-67, 1967.

A. S. Wightman, Hilbert???s sixth problem: mathematical treatment of the axioms of physics, Procceding of Symposia in Pure Mathematics, 1976.
DOI : 10.1090/pspum/028.1/0436800

P. Bruno-woltzenlogel, A General Analysis of Cut-Elimination by CERes, 2009.

P. Bruno-woltzenlogel, Atomic Cut Introduction by Resolution: Proof Structuring and Compression, 2010.
DOI : 10.1007/978-3-642-17511-4_26