Results 1 
8 of
8
On the NoCounterexample Interpretation
 J. SYMBOLIC LOGIC
, 1997
"... In [15],[16] Kreisel introduced the nocounterexample 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 firstorder Peano arithmetic PA one can find ordinal recursive f ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
(Show Context)
In [15],[16] Kreisel introduced the nocounterexample 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 firstorder 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
Elimination of Skolem functions for monotone formulas in analysis
 ARCHIVE FOR MATHEMATICAL LOGIC
"... ..."
On the Computational Content of the BolzanoWeierstraß Principle
, 2009
"... We will apply the methods developed in the field of ‘proof mining’ to the BolzanoWeierstraß theorem BW and calibrate the computational contribution of using this theorem in proofs of combinatorial statements. We provide an explicit solution of the Gödel functional interpretation (combined with nega ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
(Show Context)
We will apply the methods developed in the field of ‘proof mining’ to the BolzanoWeierstraß theorem BW and calibrate the computational contribution of using this theorem in proofs of combinatorial statements. We provide an explicit solution of the Gödel functional interpretation (combined with negative translation) as well as the monotone functional interpretation of BW for the product space ∏i∈N[−k i, k i] (with the standard product metric). This results in optimal program and bound extraction theorems for proofs based on fixed instances of BW, i.e. for BW applied to fixed sequences in ∏i∈N[−k i, k i].
A simple proof of Parsons' theorem
"... Let I# 1 be the fragment of elementary Peano Arithmetic in which induction is restricted to #1formulas. More than three decades ago, Charles Parsons showed that the provably total functions of I# 1 are exactly the primitive recursive functions. In this paper, we observe that Parsons' resul ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Let I# 1 be the fragment of elementary Peano Arithmetic in which induction is restricted to #1formulas. More than three decades ago, Charles Parsons showed that the provably total functions of I# 1 are exactly the primitive recursive functions. In this paper, we observe that Parsons' result is a consequence of Herbrand's theorem concerning the of universal theories. We give a selfcontained proof requiring only basic knowledge of mathematical logic.
Things that can and things that can't be done in PRA
, 1998
"... It is wellknown by now that large parts of (nonconstructive) mathematical reasoning can be carried out in systems T which are conservative over primitive recursive arithmetic PRA (and even much weaker systems). On the other hand there are principles S of elementary analysis (like the BolzanoW ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
It is wellknown by now that large parts of (nonconstructive) mathematical reasoning can be carried out in systems T which are conservative over primitive recursive arithmetic PRA (and even much weaker systems). On the other hand there are principles S of elementary analysis (like the BolzanoWeierstra principle, the existence of a limit superior for bounded sequences etc.) which are known to be equivalent to arithmetical comprehension (relative to T ) and therefore go far beyond the strength of PRA (when added to T ). In this paper
TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS
"... Abstract. In this paper we study with prooftheoretic methods the function(al)s provably recursive relative to Ramsey’s theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functionals provably recursive from RCA0 + COH + Π0 1CP are primitive recursive. This ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we study with prooftheoretic methods the function(al)s provably recursive relative to Ramsey’s theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functionals provably recursive from RCA0 + COH + Π0 1CP are primitive recursive. This also provides a uniform method to extract bounds from proofs that use these principles. As a consequence we obtain a new proof of the fact that WKL0 + Π0 1CP + COH is Π0 2conservative over PRA. Recent work of the first author showed that Π0 1CP + COH is equivalent to a weak variant of the BolzanoWeierstraß principle. This makes it possible to use our results to analyze not only combinatorial but also analytical proofs. For Ramsey’s theorem for pairs and two colors (RT2 2) we obtain the upper bounded that the type 2 functionals provable recursive relative to RCA0 + Σ0 2IA+RT2 2 are in T1. This is the fragment of Gödel’s system T containing only type 1 recursion — roughly speaking it consists of functions of Ackermann type. With this we also obtain a uniform method for the extraction of T1bounds from proofs that use RT2 2. Moreover, this yields a new proof of the fact that WKL0 + Σ0 2IA + RT2 2 is Π0 3conservative over RCA0 + Σ0 2IA. The results are obtained in two steps: in the first step a term including Skolem functions for the above principles is extracted from a given proof. This is done using Gödel’s functional interpretation. After this the term is normalized, such that only specific instances of the Skolem functions are used. In the second step this term is interpreted using Π0 1comprehension. The comprehension is then eliminated in favor of induction using either elimination of monotone Skolem functions (for COH) or Howard’s ordinal analysis of bar recursion (for RT2 2). 1.
This document in subdirectoryRS/98/18/ Things
, 1998
"... Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS ..."
Abstract
 Add to MetaCart
(Show Context)
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS
This document in subdirectoryRS/97/42/
, 1997
"... Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS ..."
Abstract
 Add to MetaCart
(Show Context)
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS