Abstract
In Chapter 6 the CERES method was defined as a cut-elimination method for LK-proofs. But the method is potentially much more general and can be extended to a wide range of first-order cacluli. First of all CERES is a semantic method, in the sense that it works for all sound sequent calculi with a definable ancestor relation and a semantically complete clausal calculus. In this chapter we first show that a CERES method can be defined for virtually any sound sequent calculus. Second, we define extensions of LK by equality and definitions rules which are useful for formalizing mathematical theorems and show how to adapt CERES to these extensions of LK. The extension LKDe defined in Section 7.3 will then be used for the analysis of mathematical proofs in Section 8.5.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
M. Baaz, A. Leitsch: Cut-Elimination and Redundancy-Elimination by Resolution. Journal of Symbolic Computation, 29, pp. 149–176, 2000.
M. Baaz, A. Leitsch: Towards a Clausal Analysis of Cut-Elimination. Journal of Symbolic Computation, 41, pp. 381–410, 2006.
P. Brauner, C. Houtmann, C. Kirchner: Principles of Superdeduction. Proceedings of LICS, pp. 41–50, 2007.
A. Degtyarev, A. Voronkov: Equality Reasoning in Sequent-Based Calculi. In: A. Robinson, A. Voronkov (eds.), Handbook of Automated Reasoning, vol. I, chapter 10, Elsevier Science, Amsterdam, pp. 611–706, 2001.
G. Dowek, T. Hardin, C. Kirchner: Theorem Proving Modulo. Journal of Automated Reasoning, 31, pp. 32–72, 2003.
G. Dowek, B. Werner: Proof Normalization Modulo. Journal of Symbolic Logic, 68(4), pp. 1289–1316, 2003.
E. Eder: Relative Complexities of First-Order Calculi. Vieweg, Braunschweig, 1992.
G. Gentzen: Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39, pp. 405–431, 1934–1935.
R. Nieuwenhuis, A. Rubio: Paramodulation-Based Theorem Proving. In: J.A. Robinson, A. Voronkov (eds.), Handbook of Automated Reasoning, Elsevier, Amsterdam, pp. 371–443, 2001.
G. Takeuti: Proof Theory. North-Holland, Amsterdam, 2nd edition, 1987.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Baaz, M., Leitsch, A. (2011). Extensions of CERES. In: Methods of Cut-Elimination. Trends in Logic, vol 34. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0320-9_7
Download citation
DOI: https://doi.org/10.1007/978-94-007-0320-9_7
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0319-3
Online ISBN: 978-94-007-0320-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)