Autarkic Computations in Formal Proofs

Autarkic Computations in Formal Proofs (1997)

Cached

Download Links

[ftp.cs.kun.nl]

Other Repositories/Bibliography

DBLP

by Henk Barendregt , Erik Barendsen

Venue:	J. Autom. Reasoning
Citations:	17 - 1 self

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	Autarkic computations in formal proofs	INFERENCE
AUTHOR NAME	Henk Barendregt	SVM HeaderParse 0.1
AUTHOR AFFIL	Computing Science Institute; University of Nijmegen	SVM HeaderParse 0.2
AUTHOR ADDR	Toernooiveld 1, 6525 ED Nijmegen, The Netherlands	SVM HeaderParse 0.1
AUTHOR NAME	Erik Barendsen	SVM HeaderParse 0.1
AUTHOR AFFIL	Computing Science Institute; University of Nijmegen	SVM HeaderParse 0.2
AUTHOR ADDR	Toernooiveld 1, 6525 ED Nijmegen, The Netherlands	SVM HeaderParse 0.1
ABSTRACT	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, L A T E X. Modern systems for proof-development make the formalization of reasoning relatively easy. Formalizing computations such that the results can be used in formal proofs is not immediate. In this paper it is shown how to obtain formal proofs of statements like Prime(61) in the context of Peano arithmetic or (x + 1)(x + 1) = x 2 + 2x + 1 in the context of rings. It is hoped that the method will help bridge the gap between the efficient systems of computer algebra and the reliable systems of proof-development. 1. The problem Usual mathematics is informal but precise. One speaks about informal rigor. Formal mathematics on the other hand consists of definitions, statements and proo...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	J. Autom. Reasoning	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	2002	INFERENCE
VOLUME	28	INFERENCE
CITATIONS	17 found	ParsCit 1.0