Results 1 -
4 of
4
On the No-Counterexample Interpretation
- J. SYMBOLIC LOGIC
, 1997
"... In [15],[16] Kreisel introduced the no-counterexample interpretation (n.c.i.) of Peano arithmetic. In particular he proved, using a complicated "-substitution method (due to W. Ackermann), that for every theorem A (A prenex) of first-order Peano arithmetic PA one can find ordinal recursive functi ..."
Abstract
-
Cited by 12 (4 self)
- Add to MetaCart
In [15],[16] Kreisel introduced the no-counterexample interpretation (n.c.i.) of Peano arithmetic. In particular he proved, using a complicated "-substitution method (due to W. Ackermann), that for every theorem A (A prenex) of first-order Peano arithmetic PA one can find ordinal recursive functionals \Phi A of order type ! " 0 which realize the Herbrand normal form A of A. Subsequently more
Kreisel's `Unwinding Program
- In Odifreddi [53
, 1996
"... Through his own contributions (individual and collaborative) and his extraordinary personal influence, Georg Kreisel did perhaps more than anyone else to promote the development of proof theory and the metamathematics of constructivity in the last forty-odd years. My purpose here is to give ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
Through his own contributions (individual and collaborative) and his extraordinary personal influence, Georg Kreisel did perhaps more than anyone else to promote the development of proof theory and the metamathematics of constructivity in the last forty-odd years. My purpose here is to give
unknown title
, 2005
"... Le contenu computationnel des preuves: No-counterexample interpretation et spécification des théorèmes de l’arithmétique mémoire sous la direction de Jean-Louis Krivine ..."
Abstract
- Add to MetaCart
Le contenu computationnel des preuves: No-counterexample interpretation et spécification des théorèmes de l’arithmétique mémoire sous la direction de Jean-Louis Krivine
