Applications of CERES

CERES has applications to complexity theory, proof theory and to general mathematics. We first characterize classes of proofs which admit fast cut-elimination due to the resulting structure of the characteristic clause sets. Furthermore CERES can be applied to the efficient constructions of interpolants in classical logic and other logics for which CERES-methods can be defined. CERES is also suitable for calculating most general proofs from proof examples. Finally we demonstrate that CERES is also an efficient tool for the in-depth analysis of mathematical proofs.

[1]  Ulrich Kohlenbach,et al.  Applied Proof Theory - Proof Interpretations and their Use in Mathematics , 2008, Springer Monographs in Mathematics.

[2]  Matthias Baaz,et al.  Generalizing proofs in monadic languages , 2008, Ann. Pure Appl. Log..

[3]  Alexander Leitsch,et al.  Proof Transformation by CERES , 2006, MKM.

[4]  Alexander Leitsch,et al.  Cut Normal Forms and Proof Complexity , 1999, Ann. Pure Appl. Log..

[5]  Geuvers Herman,et al.  Classical Logic and Computation , 2012 .

[6]  William W. Tait,et al.  Normal derivability in classical logic , 1968 .

[7]  Alexander Leitsch,et al.  Cut-Elimination: Experiments with CERES , 2005, LPAR.

[8]  H. Luckhardt,et al.  Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken , 1989, Journal of Symbolic Logic.

[9]  Alexander Leitsch,et al.  CERES: An analysis of Fürstenberg's proof of the infinity of primes , 2008, Theoretical Computer Science.

[10]  Alexander Leitsch,et al.  The Resolution Calculus , 1997, Texts in Theoretical Computer Science An EATCS Series.

[11]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[12]  Martin Aigner,et al.  Proofs from THE BOOK , 1998 .

[13]  Jon Barwise,et al.  The Syntax and Semantics of Infinitary Languages , 1968 .

[14]  V. Orevkov.  Lower bounds for increasing complexity of derivations after cut elimination , 1982 .

[15]  Peter B. Andrews.  Resolution in type theory , 1971, Journal of Symbolic Logic.

[16]  J. Girard.  Proof Theory and Logical Complexity , 1989 .

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

[18]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[19]  Alexander Leitsch,et al.  Towards a clausal analysis of cut-elimination , 2006, J. Symb. Comput..

[20]  P. Clote,et al.  Arithmetic, proof theory, and computational complexity , 1993 .