|
17
|
Dependent choices, ‘quote’ and the clock
– Jean-louis Krivine
- 2003
|
|
12
|
On the No-Counterexample Interpretation
– Ulrich Kohlenbach
- 1997
|
|
5
|
Ordinals and Interactive Programs
– Peter Hancock
- 2000
|
|
|
System T and the Product of Selection Functions
– Martín Escardó, Paulo Oliva, Thomas Powell
|
|
|
PROOF INTERPRETATIONS AND MAJORIZABILITY
– Fernando Ferreira
|
|
2
|
Gödels reformulation of Gentzen’s first consistency proof for arithmetic: the no-counterexample interpretation
– W. W. Tait, W. W. Tait
- 2005
|
|
28
|
A semantic view of classical proofs -- type-theoretic, categorical, and denotational characterizations (Extended Abstract)
– C.-H. L. Ong
- 1996
|
|
2
|
Realizability : a machine for analysis and set theory
– Jean-louis Krivine
- 2006
|
|
|
zeta-function
– unknown authors
|
|
8
|
Kreisel's `Unwinding Program
– Solomon Feferman
- 1996
|
|
21
|
Type Theory and Programming
– Thierry Coquand , Bengt Nordström, Jan M. Smith, Björn von Sydow
- 1994
|
|
2
|
Hilbert’s Program Then and Now
– Richard Zach
- 2005
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
91
|
Martin-Löf’s Type Theory
– B. Nordström, K. Petersson, J. M. Smith
- 2000
|
|
3
|
Nominal System T
– Andrew M. Pitts
- 2010
|
|
|
The proof theory of classical and constructive inductive definitions. A 40 year saga, 1968-2008.
– Solomon Feferman
- 2008
|
|
|
Notre Dame Journal of Formal Logic The Computational Content of Arithmetical Proofs
– Stefan Hetzl
|
|
46
|
Metatheory and Reflection in Theorem Proving: A Survey and Critique
– John Harrison
- 1995
|
|
|
JACQUES HERBRAND: LIFE, LOGIC, AND AUTOMATED DEDUCTION
– Claus-peter Wirth, Jörg Siekmann, Christoph Benzmüller, Serge Autexier
|
