Affiliation:
1. Radboud University Nijmegen6500 GL Nijmegen, The Netherlands
Abstract
Progress in the foundations of mathematics has made it possible to formulate all thinkable mathematical concepts, algorithms and proofs in one language and in an impeccable way. This is not in spite of, but partially based on the famous results of Gödel and Turing. In this way statements are about mathematical objectsandalgorithms, proofs show the correctness of statementsandcomputations, and computations are dealing with objectsandproofs. Interactive computer systems for a full integration of defining, computing and proving are based on this. The human defines concepts, constructs algorithms and provides proofs, while the machine checks that the definitions are well formed and the proofs and computations are correct. Results formalized so far demonstrate the feasibility of this ‘computer mathematics’. Also there are very good applications. The challenge is to make the systems more mathematician-friendly, by building libraries and tools. The eventual goal is to help humans to learn, develop, communicate, referee and apply mathematics.
Subject
General Physics and Astronomy,General Engineering,General Mathematics
Reference57 articles.
1. Zum Hilbertschen Aufbau der reellen Zahlen
2. Aczel P. & Rathjen M. (2001). Notes on constructive set theory. Technical report Institut Mittag-Leffler. http://www.ml.kva.se/preprints/meta/AczelMon_Sep_24_09_16_56.rdf.html.
3. Every planar map is four colorable. Part I. Discharging;Appel K;Illinois J. Math,1977
4. Every planar map is four colorable. Part II. Reducibility;Appel K;Illinois J. Math,1977
5. The status of the classification of the finite simple groups;Aschbacher M;Math. Monthly,2004
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献