Skip to main content
SpringerLink
Log in

System Description: The Proof Transformation System CERES

  • Conference paper
  • First Online:
Automated Reasoning (IJCAR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6173))

Included in the following conference series:

Abstract

Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-elimination by resolution) works by extracting a set of clauses from a proof with cuts. Any resolution refutation of this set then serves as a skeleton of an ACNF, an LK-proof with only atomic cuts.

The system CERES, an implementation of the CERES-method has been used successfully in analyzing nontrivial mathematical proofs (see 4).In this paper we describe the main features of the CERES system with special emphasis on the extraction of Herbrand sequents and simplification methods on these sequents. We demonstrate the Herbrand sequent extraction and simplification by a mathematical example.

Supported by the Austrian Science Fund (project no. P22028-N13).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, P.B.: Resolution in Type Theory. J. of Symbolic Logic 36, 414–432 (1971)

    Article  MathSciNet  Google Scholar 

  2. Baaz, M., Hetzl, S., Leitsch, A., Richter, C., Spohr, H.: Proof Transformation by CERES. In: Borwein, J.M., Farmer, W.M. (eds.) MKM 2006. LNCS (LNAI), vol. 4108, pp. 82–93. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Baaz, M., Hetzl, S., Leitsch, A., Richter, C., Spohr, H.: System Description: The Cut-Elimination System CERES. In: Proc. ESCoR 2006, pp. 159–167 (2006)

    Google Scholar 

  4. Baaz, M., Hetzl, S., Leitsch, A., Richter, C., Spohr, H.: CERES: An analysis of Fürstenberg’s proof of the infinity of primes. Th. Co. Sci. 403, 160–175 (2008)

    Article  Google Scholar 

  5. Baaz, M., Leitsch, A.: Cut-Elimination and Redundancy-Elimination by Resolution. Journal of Symbolic Computation 29, 149–176 (2000)

    Article  MathSciNet  Google Scholar 

  6. Baaz, M., Leitsch, A.: Towards a Clausal Analysis of Cut-Elimination. Journal of Symbolic Computation 41, 381–410 (2006)

    Article  MathSciNet  Google Scholar 

  7. Dunchev, T.: Simplification of Herbrand Sequents. Master Thesis (2009)

    Google Scholar 

  8. Gentzen, G.: Untersuchungen über das logische Schliessen. Mathematische Zeitschrift 39, 176–210, 405–431 (1934-1935)

    Article  Google Scholar 

  9. Hetzl, S., Leitsch, A., Weller, D., Woltzenlogel Paleo, B.: Herbrand sequent extraction. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC 2008, Calculemus 2008, and MKM 2008. LNCS (LNAI), vol. 5144, pp. 462–477. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Hetzl, S., Leitsch, A., Weller, D., Woltzenlogel Paleo, B.: A Clausal Approach to Proof Analysis in Second-Order Logic. In: Logical Foundations of Computer Sci. (2009)

    Google Scholar 

  11. Woltzenlogel Paleo, B.: Herbrand Sequent Extraction. VDM-Verlag (2008)

    Google Scholar 

  12. Woltzenlogel Paleo, B.: A General Analysis of Cut-Elimination by CERes. PhD Thesis (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Languages (E185), Vienna University of Technology, Favoritenstraße 9, 1040, Vienna, Austria

    Tsvetan Dunchev, Alexander Leitsch, Tomer Libal, Daniel Weller & Bruno Woltzenlogel Paleo

Authors
  1. Tsvetan Dunchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Leitsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tomer Libal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Daniel Weller
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bruno Woltzenlogel Paleo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RWTH Aachen, LuFG Informatik, 2, Ahornstr. 55, 52074, Aachen, Germany

    Jürgen Giesl

  2. Department of Computer Science, Chalmers University of Technology, 41296, Gothenburg, Sweden

    Reiner Hähnle

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dunchev, T., Leitsch, A., Libal, T., Weller, D., Woltzenlogel Paleo, B. (2010). System Description: The Proof Transformation System CERES . In: Giesl, J., Hähnle, R. (eds) Automated Reasoning. IJCAR 2010. Lecture Notes in Computer Science(), vol 6173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14203-1_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14203-1_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14202-4

  • Online ISBN: 978-3-642-14203-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation