Results 1 
4 of
4
Functional interpretation and inductive definitions
 Journal of Symbolic Logic
"... Abstract. Extending Gödel’s Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finitetype functionals defined using transfinite recursion on wellfounded trees. 1. ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Extending Gödel’s Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finitetype functionals defined using transfinite recursion on wellfounded trees. 1.
The computational content of classical arithmetic
, 2009
"... Almost from the inception of Hilbert’s program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various methods of extracting computational information from proofs in c ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Almost from the inception of Hilbert’s program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various methods of extracting computational information from proofs in classical firstorder arithmetic, and reflects on some of the relationships between them. Variants of the GödelGentzen doublenegation translation, some not so well known, serve to provide canonical and efficient computational interpretations of that theory.