Journal of Automated Reasoning

, Volume 28, Issue 3, pp 321–336

Autarkic Computations in Formal Proofs

  • Henk Barendregt
  • Erik Barendsen

DOI: 10.1023/A:1015761529444

Cite this article as:
Barendregt, H. & Barendsen, E. Journal of Automated Reasoning (2002) 28: 321. doi:10.1023/A:1015761529444


Formal proofs in mathematics and computer science are being studied because these objects can be verified by a very simple computer program. An important open problem is whether these formal proofs can be generated with an effort not much greater than writing a mathematical paper in, say, LATEX. Modern systems for proof development make the formalization of reasoning relatively easy. However, formalizing computations in such a manner that the results can be used in formal proofs is not immediate. In this paper we show how to obtain formal proofs of statements such as Prime(61) in the context of Peano arithmetic or (x+1)(x+1)=x2+2x+1 in the context of rings. We hope that the method will help bridge the gap between the efficient systems of computer algebra and the reliable systems of proof development.

formal proof computer algebra proof development autarkic cmputation 

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Henk Barendregt
    • 1
  • Erik Barendsen
    • 1
  1. 1.Computing Science InstituteUniversity of NijmegenNijmegenThe Netherlands. e-mail