Applied Proof Theory - Proof Interpretations and their Use in Mathematics
暂无分享,去创建一个
Preface.- Introduction.- Unwinding of proofs ('Proof Mining').- Intuitionistic and classical arithmetic in all finite types.- Representation of Polish metric spaces.- Modified realizability.- Majorizability and the fan rule.- Semi-intuitionistic systems and monotone modified realizability.- Godel's functional ('Dialectica') interpretation.- Semi-intuitionistic systems and monotone functional interpretation.- Systems based on classical logic and functional interpretation.- Functional interpretation of full classical analysis.- A non-standard principle of uniform boundedness.- Elimination of monotone Skolem functions.- The Friedman-Dragalin A-translation.- Applications to analysis: general metatheorems I.- Case study I: Uniqueness proofs in approximation theory.- Applications to analysis: general metatheorems II.- Case study II: Applications to the fixed point theory of nonexpansive mappings.- Final comments.- References.- Index.
[1] Ulrich Kohlenbach,et al. Proof Interpretations and the Computational Content of Proofs in Mathematics , 2007, Bull. EATCS.