In proof theory, a branch of mathematical logic, proof mining (or proof unwinding) is a research program that studies or analyzes formalized proofs, especially in analysis, to obtain explicit bounds, ranges or rates of convergence from proofs that, when expressed in natural language, appear to be nonconstructive. This research has led to improved results in analysis obtained from the analysis of classical proofs.
We don't have any images related to Proof mining yet.
You can add one yourself here.
We don't have any YouTube videos related to Proof mining yet.
You can add one yourself here.
We don't have any PDF documents related to Proof mining yet.
You can add one yourself here.
We don't have any Books related to Proof mining yet.
You can add one yourself here.
We don't have any archived web articles related to Proof mining yet.
Further reading
- Ulrich Kohlenbach and Paulo Oliva, "Proof Mining: A systematic way of analysing proofs in mathematics", Proc. Steklov Inst. Math, 242:136–164, 2003
- Paulo Oliva, "Proof Mining in Subsystems of Analysis", BRICS PhD thesis citeseer
References
Ulrich Kohlenbach (2008). Applied Proof Theory: Proof Interpretations and Their Use in Mathematics. Springer Verlag, Berlin. pp. 1–536. /wiki/Ulrich_Kohlenbach ↩