Le contenu computationnel des preuves: No-counterexample interpretation et spécification des théorèmes de l’arithmétique (2002)

Cached

Download Links

by Denis Bonnay

Active Bibliography

24 Dependent choices, ‘quote’ and the clock – Jean-louis Krivine - 2003
18 On the No-Counterexample Interpretation – Ulrich Kohlenbach - 1997
4 Gödel’s functional interpretation and its use in current mathematics – Ulrich Kohlenbach
3 A uniform quantitative form of sequential weak compactness and Baillon’s . . . – Ulrich Kohlenbach - 2011
9 Proof Interpretations and the Computational Content of Proofs. Draft of book in preparation – Ulrich Kohlenbach - 2007
1 Realizability in classical logic – Jean-louis Krivine - 2007
5 Ordinals and Interactive Programs – Peter Hancock - 2000
System T and the Product of Selection Functions – Martín Escardó, Paulo Oliva, Thomas Powell
On the asymptotic behavior of odd operators – Ulrich Kohlenbach, Technische Universität Darmstadt - 2011
On quantitative versions of theorems due to F. E. Browder and R. Wittmann – Ulrich Kohlenbach - 2010
The experimental effectiveness of mathematical proof – Alexandre Miquel
1 PROOF INTERPRETATIONS AND MAJORIZABILITY – Fernando Ferreira
CONTENTS – Mauricio Guillermo, Mauricio Guillermo - 2011
30 A semantic view of classical proofs -- type-theoretic, categorical, and denotational characterizations (Extended Abstract) – C.-H. L. Ong - 1996
2 Gödels reformulation of Gentzen’s first consistency proof for arithmetic: the no-counterexample interpretation – W. W. Tait, W. W. Tait - 2005
Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms – Federico Aschieri
4 Realizability : a machine for analysis and set theory – Jean-louis Krivine - 2006
Realizability for Peano Arithmetic with Winning Conditions in HON Games – Valentin Blot - 2013
11 Kreisel's `Unwinding Program – Solomon Feferman - 1996