Abstract
AbstractComputer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, machine learning results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities.
Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,Philosophy
Reference76 articles.
1. Alemi, A. A., Chollet, F., Een, N., Irving, G., Szegedy, C., & Urban, J. (2017). DeepMath—deep sequence models for premise selection. arXiv:1606.04442 [Cs]. http://arxiv.org/abs/1606.04442.
2. Appel, K., & Haken, W. (1976). Every planar map is four colorable. Bulletin of the American Mathematical Society, 82(5), 711–712.
3. Bansal, K., Loos, S., Rabe, M., Szegedy, C., & Wilcox, S. J. (2019). HOList: An environment for machine learning of higher order logic theorem proving. Thirty-Sixth International Conference on Machine Learning (ICML). https://arxiv.org/abs/1904.03241.
4. Barberousse, A., & Vorms, M. (2014). About the warrants of computer-based empirical knowledge. Synthese, 191(15), 3595–3620.
5. Barendregt, H., & Wiedijk, F. (2005). The challenge of computer mathematics. Philosophical Transactions of the Royal Society A: Mathematical Physical and Engineering Sciences, 363(1835), 2351–2375. https://doi.org/10.1098/rsta.2005.1650.