Open Access
Computers : (ac)counting for mathematical proofs
Aaron Cohen
- 01 Jan 1996
- Iss: 1, pp 15-38
About: The article was published on 01 Jan 1996. and is currently open access. The article focuses on the topics: Mathematical proof.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Autarkic Computations in Formal Proofs
Henk Barendregt,Erik Barendsen +1 more
TL;DR: This paper shows how to obtain formal proofs of statements such as Prime(61) in the context of Peano arithmetic or (x+1)(x-1)=x2+2x-2 in thecontext of rings and hopes that the method will help bridge the gap between the efficient systems of computer algebra and the reliable systems of proof development.
Related Papers (5)
Jin-Yi Cai,Lane A. Hemachandra +1 more
- 01 Jun 1986
Kenneth R. Meyer,Dieter S. Schmidt +1 more
- 02 Jan 1991
U. Kulisch
- 01 Nov 1975