Computer theorem proving in math
Carlos T. Simpson
Abstract
We give an overview of issues surrounding computer-verified theorem proving in the standard pure-mathematical context. This is based on my talk at the PQR conference (Brussels, June 2003).
Create a lesson
Related papers
It is time for a New Deal for mathematics
Nestor Guillen
Around the Clock. New Twists on Fitch Cheney's Five-Card Trick
Doron Levy, Yaakov Malinovsky
Two teams that cancel: a didactic analysis of a teaching progression for signed numbers from Grade 5 to Grade 7
Vincent Tariel-Adam
Letter to a Young Black Mathematician: History, Storytelling, and Belonging in Mathematics
Ranthony A. Clark
Early career researcher responses to AI in math
Anna Brandenberger, Hanna Mularczyk, Dora Woodruff
A Diophantine generalization of Fourier's irrationality trick
Archan Chattopadhyay, Chandan Chattopadhyay