TY - JOUR AU - Kohlenbach, Ulrich PY - 1998/01/18 Y2 - 2024/03/28 TI - Things that can and things that can’t be done in PRA JF - BRICS Report Series JA - BRICS VL - 5 IS - 18 SE - Articles DO - 10.7146/brics.v5i18.19424 UR - https://tidsskrift.dk/brics/article/view/19424 SP - AB - 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<br />comprehension (relative to T ) and therefore go far beyond the strength of PRA (when added to T ). <br />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<br />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. ER -