ON THE DECISION PROBLEM AND THE MECHANIZATION OF THEOREM-PROVING IN ELEMENTARY GEOMETRY

被引:0
作者
吴文俊
机构
[1] Institute of Mathematics
[2] Academia Sinica
关键词
D O I
暂无
中图分类号
学科分类号
摘要
<正> The idea of proving theorems mechanically may be dated back to Leibniz in the 17th century and has been formulated in precise mathematical forms in this century through the school of Hilbert as well as his followers on mathematical logic. The problem consists in essence in replacing qualitative difficulties inherited in usual mathematical proofs by quantitative complexities of calculations on standardizing the proof procedures in an algorithmic manner. Such quantitative complexities of calculations, formerly far beyond the reach of human abilities, have become more and more trivial owing to the occurrence and rapid development of computers. In spite of vigorous efforts, however, researches in this direction give rise quite often to negative results in the form of undecidable mathematical theories. To cite a notable positive result, we may mention Tarski's method of proving theorems mechanically in elementary geometry and elementary algebra. The methods of Tarski as well as later ones are largely based o
引用
收藏
页码:159 / 172
页数:14
相关论文
共 2 条
[1]  
Die Frage der endlich vielen Schritte in der Theorie der Polynomideale[J] Grete Hermann Mathematische Annalen 1926, 1
[2]  
中国数学史[M] 钱宝琮 编 科学出版社 1964,