Results 1 
5 of
5
Mathematically Strong Subsystems of Analysis With Low Rate of Growth of Provably Recursive Functionals
, 1995
"... This paper is the first one in a sequel of papers resulting from the authors Habilitationsschrift [22] which are devoted to determine the growth in proofs of standard parts of analysis. A hierarchy (GnA # )n#I N of systems of arithmetic in all finite types is introduced whose definable objects of ..."
Abstract

Cited by 34 (21 self)
 Add to MetaCart
This paper is the first one in a sequel of papers resulting from the authors Habilitationsschrift [22] which are devoted to determine the growth in proofs of standard parts of analysis. A hierarchy (GnA # )n#I N of systems of arithmetic in all finite types is introduced whose definable objects of type 1 = 0(0) correspond to the Grzegorczyk hierarchy of primitive recursive functions. We establish the following extraction rule for an extension of GnA # by quantifierfree choice ACqf and analytical axioms # having the form #x # #y ## sx#z # F0 (including also a `non standard' axiom F  which does not hold in the full settheoretic model but in the strongly majorizable functionals): From a proof GnA # +ACqf + # # #u 1 , k 0 #v ## tuk#w 0 A0(u, k, v, w) one can extract a uniform bound # such that #u 1 , k 0 #v ## tuk#w # #ukA0 (u, k, v, w) holds in the full settheoretic type structure. In case n = 2 (resp. n = 3) #uk is a polynomial (resp. an elementary recursive function) in k, u M := #x. max(u0, . . . , ux). In the present paper we show that for n # 2, GnA # +ACqf+F  proves a generalization of the binary Knig's lemma yielding new conservation results since the conclusion of the above rule can be verified in G max(3,n) A # in this case. In a subsequent paper we will show that many important ine#ective analytical principles and theorems can be proved already in G2A # +ACqf+# for suitable #. 1
Foundational and mathematical uses of higher types
 REFLECTIONS ON THE FOUNDATIONS OF MATHEMATICS: ESSAY IN HONOR OF SOLOMON FEFERMAN
, 1999
"... In this paper we develop mathematically strong systems of analysis in higher types which, nevertheless, are prooftheoretically weak, i.e. conservative over elementary resp. primitive recursive arithmetic. These systems are based on noncollapsing hierarchies ( n WKL+ ; n WKL+ ) of principles ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
In this paper we develop mathematically strong systems of analysis in higher types which, nevertheless, are prooftheoretically weak, i.e. conservative over elementary resp. primitive recursive arithmetic. These systems are based on noncollapsing hierarchies ( n WKL+ ; n WKL+ ) of principles which generalize (and for n = 0 coincide with) the socalled `weak' König's lemma WKL (which has been studied extensively in the context of second order arithmetic) to logically more complex tree predicates. Whereas the second order context used in the program of reverse mathematics requires an encoding of higher analytical concepts like continuous functions F : X ! Y between Polish spaces X;Y , the more exible language of our systems allows to treat such objects directly. This is of relevance as the encoding of F used in reverse mathematics tacitly yields a constructively enriched notion of continuous functions which e.g. for F : IN ! IN can be seen (in our higher order context)
On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness
 PURE AND APPLIED LOGIC
, 1997
"... In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems T n in all finite types which are suited to formalize substantial parts of analysis but ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems T n in all finite types which are suited to formalize substantial parts of analysis but nevertheless have provably recursive function(al)s of low growth. We reduce the use of instances of these principles in T n proofs of a large class of formulas to the use of instances of certain arithmetical principles thereby determining faithfully the arithmetical content of the former. This is achieved using the method of elimination of Skolem functions for monotone formulas which was introduced by the author in a previous paper. As
A note on the Π 0 2induction rule
 Arch. Math. Logic
, 1995
"... It is well–known (due to C. Parsons) that the extension of primitive recursive arithmetic PRA by first–order predicate logic and the rule of Π 0 2 –induction Π0 2 –IR is Π02 –conservative over PRA. We show that this is no longer true in the presence of function quantifiers and quantifier–free choice ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
It is well–known (due to C. Parsons) that the extension of primitive recursive arithmetic PRA by first–order predicate logic and the rule of Π 0 2 –induction Π0 2 –IR is Π02 –conservative over PRA. We show that this is no longer true in the presence of function quantifiers and quantifier–free choice for numbers AC0,0 – qf. More precisely we show that T:=PRA2 + Π0 2 –IR+AC0,0–qf proves the totality of the Ackermann function, where PRA2 is the extension of PRA by number and function quantifiers and Π0 2 –IR may contain function parameters. This is true even for PRA2 + Σ0 1 –IR+Π02 –IR−+AC0,0–qf, where Π0 2 –IR − is the restriction of Π0 2 –IR without function parameters. 1 Let (PRA) denote the extension of primitive recursive arithmetic obtained by adding first–order predicate logic. By the rule IR of induction we mean
A Note on the ...Induction Rule
"... It is wellknown (due to C. Parsons) that the extension of primitive recursive arithmetic PRA by firstorder predicate logic and the rule of # 2 induction 2 IR is # 2 conservative over PRA. We show that this is no longer true in the presence of function quantifiers and quantifierfree ch ..."
Abstract
 Add to MetaCart
It is wellknown (due to C. Parsons) that the extension of primitive recursive arithmetic PRA by firstorder predicate logic and the rule of # 2 induction 2 IR is # 2 conservative over PRA. We show that this is no longer true in the presence of function quantifiers and quantifierfree choice for numbers AC  qf. More precisely we show that T :=PRA + # qf proves the totality of the Ackermann function, where PRA is the extension of PRA by number and function quantifiers and # 2 IR may contain function parameters. This is true even for PRA +# qf, where # 2 IR  is the restriction of # 2 IR without function parameters.