Proof Mining: A Systematic Way of Analysing Proofs in Mathematics
By Ulrich Kohlenbach, Paulo Oliva. 2002
94 citations recorded by the source corpus.
We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtaining new information. In this survey paper we discuss, by means of examples from mathematics, some of the main techniques used in proof mining. We show that those techniques not only apply to proofs based on classical logic, but also to proofs which involve non-effective principles such as the attainment of the infimum of f in C[0,1] and the convergence for bounded monotone sequences of reals. We also report on recent case studies in approximation theory and fixed point theory where new results were obtained.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/a9edc45446bb1ebcb81107fc9fcaeb8248a3553b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
- Ulrich Kohlenbach
- Laurentiu Leustean
- Paulo Oliva
- Genaro López-Acedo
- David Ariza-Ruiz
- Philipp Gerhardy
- Jeremy Avigad
Citations in the corpus
- Some logical metatheorems with applications in functional analysis (2003, background): “applications in analysis (see [28, 30, 32] and, for a survey, [39] and the articles cited there).”