Learning Logic and Proof with an Interactive Theorem Prover
- 100 Downloads
A course developed by Robert Y. Lewis, Floris van Doorn, and the author serves as an undergraduate introduction to mathematical proof, symbolic logic, and interactive theorem proving. The treatment of each topic on its own is routine, and the novelty lies in the way they are combined to form a multifaceted introduction to mathematical reasoning and argumentation. Students are required to master three different languages: informal mathematical language, formal symbolic logic, and a computational proof language that lies somewhere in between. Experience teaching the course suggests that students have no trouble keeping the languages distinct while at the same appreciating the relationships between them, and that the multiple representations support one another and provide a robust understanding of mathematical proof.
I am grateful to Mateja Jamnik and Keith Jones for helpful comments, corrections, and suggestions.
- Avigad, J., Lewis, R. Y., & van Doorn, F. (2019). Logic and Proof. http://leanprover.github.io/logic_and_proof/.
- Barwise, J., & Etchemendy, J. (1994). Hyperproof. Stanford, CA: CSLI Publications.Google Scholar
- Carter, N. C., & Monks, K. G. (2016). From formal to expository: using the proof-checking word processor Lurch to teach proof writing. In Schwell, Steurer & Vasquez (Eds.), Beyond lecture: Techniques to improve student proof-writing across the curriculum. MAA Press. http://lurchmath.org/.
- de Moura, L., Kong, S., Avigad, J., van Doorn, F., & von Raumer, J. (2015) The Lean theorem prover. In A. P. Felty & A. Middeldorp (Eds.), Proceedings of the 25th International Conference on Automated Deduction (CADE-25) (pp. 378–388). Berlin: Springer. https://leanprover.github.io/.
- Inglis, M., & Attridge, N. (2017). Does mathematical study develop logical thinking. Testing the Theory of Formal Discipline. London: World Scientific.Google Scholar
- Sieg, W. (2007). AProS project: Strategic thinking and computational logic. Logic Journal of the IGPL15(4), 359–368. http://www.phil.cmu.edu/projects/apros.
- Velleman, D. (2006) How to prove it: A structured approach (2nd ed.). Cambridge: Cambridge University Press. https://app.cs.amherst.edu/~djvelleman/pd/pd.html.