Essential Structure of Proofs as a Measure of Complexity

The essential structure of proofs is proposed as the basis for a measure of complexity of formulas in FOL. The motivating idea was the recognition that distinct theorems can have the same derivation modulo some non essential details. Hence the difficulty in proving them is identical and so their complexity should be the same. We propose a notion of complexity of formulas capturing this property. With this purpose, we introduce the notions of schema calculus, schema derivation and description complexity of a schema formula. Based on these concepts we prove general robustness results that relate the complexity of introducing a logical constructor with the complexity of the component schema formulas as well as the complexity of a schema formula across different schema calculi.

[1]  Helmut Schwichtenberg,et al.  Basic proof theory (2nd ed.) , 2000 .

[2]  Dag Prawitz.  Formulation des bétons autoplaçants : Optimisation du squelette granulaire par la méthode graphique de Dreux - Gorisse , 1974 .

[3]  Jan Krajícek,et al.  The number of proof lines and the size of proofs in first order logic , 1988, Arch. Math. Log..

[4]  M. E. Szabo,et al.  The collected papers of Gerhard Gentzen , 1969 .

[5]  Greg Restall,et al.  Normal Proofs, Cut Free Derivations and Structural Rules , 2014, Studia Logica.

[6]  Sara Negri,et al.  Structural proof theory , 2001 .

[7]  V. P. Orevkov.  Complexity of Proofs and Their Transformations in Axiomatic Theories , 1993 .

[8]  Patrick Blackburn,et al.  Modal logic: a semantic perspective , 2007, Handbook of Modal Logic.

[9]  Cristina Sernadas,et al.  Modulated Fibring and The Collapsing Problem , 2002, J. Symb. Log..

[10]  Vladimir A. Uspensky,et al.  Kolmogorov and mathematical logic , 1992, Journal of Symbolic Logic.

[11]  A. N. Kolmogorov.  Combinatorial foundations of information theory and the calculus of probabilities , 1983 .

[12]  Jan Kraj mIček.  On the number of steps in proofs , 1989 .

[14]  Rohit Parikh.  Some results on the length of proofs , 1973 .

[15]  Helmut Schwichtenberg,et al.  Basic proof theory , 1996, Cambridge tracts in theoretical computer science.

[16]  Emil Jerábek,et al.  Proof complexity of intuitionistic implicational formulas , 2017, Ann. Pure Appl. Log..

[17]  Cristina Sernadas,et al.  Preservation of Admissible Rules when Combining Logics , 2016, Rev. Symb. Log..