Review of Symbolic Logic 13 (1):23-46 (2020)

Rebecca Morris
Independent Scholar
Mathematicians judge proofs to possess, or lack, a variety of different qualities, including, for example, explanatory power, depth, purity, beauty and fit. Philosophers of mathematical practice have begun to investigate the nature of such qualities. However, mathematicians frequently draw attention to another desirable proof quality: being motivated. Intuitively, motivated proofs contain no "puzzling" steps, but they have received little further analysis. In this paper, I begin a philosophical investigation into motivated proofs. I suggest that a proof is motivated if and only if mathematicians can identify (i) the tasks each step is intended to perform; and (ii) where each step could have reasonably come from. I argue that motivated proofs promote understanding, convey new mathematical resources and stimulate new discoveries. They thus have significant epistemic benefits and directly contribute to the efficient dissemination and advancement of mathematical knowledge. Given their benefits, I also discuss the more practical matter of how we can produce motivated proofs. Finally I consider the relationship between motivated proofs and proofs which are explanatory, beautiful and fitting.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/s1755020319000583
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 60,021
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Mathematical Explanation.Mark Steiner - 1978 - Philosophical Studies 34 (2):135 - 151.
Why Do We Prove Theorems?Yehuda Rav - 1999 - Philosophia Mathematica 7 (1):5-41.
Purity of Methods.Michael Detlefsen & Andrew Arana - 2011 - Philosophers' Imprint 11.
Modularity in Mathematics.Jeremy Avigad - 2020 - Review of Symbolic Logic 13 (1):47-79.

View all 18 references / Add more references

Citations of this work BETA

Plans and Planning in Mathematical Proofs.Yacin Hamami & Rebecca Lea Morris - forthcoming - Review of Symbolic Logic:1-40.

Add more citations

Similar books and articles

Probabilistic Proofs and Transferability.Kenny Easwaran - 2009 - Philosophia Mathematica 17 (3):341-362.
Mathematical Explanations That Are Not Proofs.Marc Lange - 2018 - Erkenntnis 83 (6):1285-1302.
The Depth of Resolution Proofs.Alasdair Urquhart - 2011 - Studia Logica 99 (1-3):349-364.
Six Theistic Proofs.Charles Hartshorne - 1970 - The Monist 54 (2):159-180.
Phallocentrism in Bergson: Life and Matter.Rebecca Hill - 2008 - Deleuze and Guatarri Studies 2 (Suppl):123-136.


Added to PP index

Total views
32 ( #331,107 of 2,433,440 )

Recent downloads (6 months)
4 ( #172,561 of 2,433,440 )

How can I increase my downloads?


My notes