Automated theorem provers: a practical tool for the working mathematician?

Authors:
Alan Bundy
Affiliations:
School of Informatics, University of Edinburgh, Edinburgh, UK EH8 9AB
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2011

Citing 7
Cited 2

Social processes and proofs of theorems and programs

Communications of the ACM
Mechanizing proof: computing, risk, and trust

Mechanizing proof: computing, risk, and trust
Proving Newton's Propositio Kepleriana Using Geometry and Nonstandard Analysis in Isabelle

ADG '98 Proceedings of the Second International Workshop on Automated Deduction in Geometry
The QED Manifesto

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Rippling: meta-level guidance for mathematical reasoning

Rippling: meta-level guidance for mathematical reasoning
Hiproofs: A Hierarchical Notion of Proof Tree

Electronic Notes in Theoretical Computer Science (ENTCS)
Ascertaining Mathematical Theorems

Electronic Notes in Theoretical Computer Science (ENTCS)

Mathematical practice, crowdsourcing, and social machines

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
European collaboration on automated reasoning

AI Communications - ECAI 2012 Turing and Anniversary Track

Quantified Score

Hi-index	0.00

Visualization

Abstract

In contrast to the widespread use of computer algebra systems in mathematics automated theorem provers have largely met with indifference. There are signs that this is at last beginning to change. We argue that it is inevitable that automated provers will be adopted as a practical tool for the working mathematician. Mathematical applications of automated provers raises profound challenges for their developers.