Things that can and things that cannot be done in PRA

被引:14
作者
Kohlenbach, U [1 ]
机构
[1] Univ Aarhus, Dept Comp Sci, DK-8000 Aarhus C, Denmark
关键词
primitive recursive arithmetic; Ackerman function; fragments of analysis; fragments of arithmetic;
D O I
10.1016/S0168-0072(99)00036-6
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
It is well known by now that large parts of (non-constructive) 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 Bolzano-Weierstrass 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 we determine precisely the arithmetical and computational strength (in terms of optimal conservation results and subrecursive characterizations of provably recursive functions) of weaker function parameter-free schematic versions S- of S, thereby exhibiting different levels of strength between these principles as well as a sharp borderline between fragments of analysis which are still conservative over PRA and extensions which just go beyond the strength of PRA. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:223 / 245
页数:23
相关论文
共 28 条
[1]  
[Anonymous], STUDIES LOGIC FDN MA
[2]  
[Anonymous], 1984, SUBRECURSION FUNCTIO
[3]  
Fairtlough M, 1998, STUD LOGIC, V137, P149
[4]  
FRIEDMAN H, 1976, J SYMBOLIC LOGIC, V41, P558
[5]  
GODEL K, 1958, DIALECTICA, V12, P280
[6]  
Hinman P. G., 1978, PERSPECTIVES MATH LO
[7]  
Kleene SC, 1952, INTRO METAMATHEMATIC
[8]   Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals [J].
Kohlenbach, U .
ARCHIVE FOR MATHEMATICAL LOGIC, 1996, 36 (01) :31-71
[9]   Elimination of Skolem functions for monotone formulas in analysis [J].
Kohlenbach, U .
ARCHIVE FOR MATHEMATICAL LOGIC, 1998, 37 (5-6) :363-390
[10]   On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness [J].
Kohlenbach, U .
ANNALS OF PURE AND APPLIED LOGIC, 1998, 95 (1-3) :257-285